Name
Abstract | ||
|---|---|---|
The lane covering game (LCG) is a cooperative game where players cooperate to reduce the cost of cycles that cover their required lanes on a network. We discuss the possibilities/impossibilities of a complete characterization of the core via dual solutions in LCGs played among a collection of shippers, each with a number of service requirements along some lanes, and show that such a complete characterization is possible if each shipper has at most one service requirement. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.orl.2014.09.002 | Operations Research Letters |
Keywords | Field | DocType |
Logistics,Lane covering problem,Cooperative game theory,Core | Mathematical optimization,Cooperative game theory,Mathematics | Journal |
Volume | Issue | ISSN |
42 | 8 | 0167-6377 |
Citations | PageRank | References |
2 | 0.39 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Behzad Hezarkhani | 1 | 31 | 5.15 |
| Marco Slikker | 2 | 191 | 46.31 |
| eu | 3 | 549 | 39.51 |