On the concavity of delivery games
From MaRDI portal
Publication:1278793
DOI10.1016/S0377-2217(96)00015-XzbMath0947.91009OpenAlexW2059952895MaRDI QIDQ1278793
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00015-x
Related Items (12)
Operations research games: A survey. (With comments and rejoinder) ⋮ On the convexity of independent set games ⋮ Chinese postman games with multi-located players ⋮ On graphs which can or cannot induce Chinese Postman games with a non-empty core ⋮ Graphs inducing totally balanced and submodular Chinese postman games ⋮ The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game ⋮ On Chinese postman games where residents of each road pay the cost of their road ⋮ A competitive solution for cooperative truckload delivery ⋮ Collaboration in Cargo Transportation ⋮ Cost allocation in the Chinese postman problem ⋮ The bargaining set for almost-convex games ⋮ On games arising from multi-depot Chinese postman problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Game theoretic analysis of a bankruptcy problem from the Talmud
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- Traveling salesman games
- On games corresponding to sequencing situations with ready times
- Cores of convex games
- HOW TO HANDLE INTERVAL SOLUTIONS FOR COOPERATIVE INTERVAL GAMES
- Minimum cost spanning tree games
- Generalized Network Problems Yielding Totally Balanced Games
- Totally Balanced Games and Games of Flow
- A Simple Expression for the Shapley Value in a Special Case
- On the core of linear production games
This page was built for publication: On the concavity of delivery games
