Approximately fair cost allocation in metric traveling salesman games
From MaRDI portal
Publication:927408
DOI10.1007/s00224-007-9072-zzbMath1135.91313OpenAlexW2089060318MaRDI QIDQ927408
Publication date: 6 June 2008
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11850/98181
Combinatorial optimizationCooperative gamesApproximate fair cost allocationFair cost allocationsTraveling salesman game
Related Items (3)
New techniques for cost sharing in combinatorial optimization games ⋮ Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation ⋮ A review on cost allocation methods in collaborative transportation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simplified NP-complete satisfiability problem
- On the core of a traveling salesman cost allocation game
- Traveling salesman games
- On approximately fair cost allocation in Euclidean TSP games
- On the core of ordered submodular cost games
- Traveling salesman games with the Monge property
- Solving covering problems and the uncapacitated plant location problem on trees
- On some balanced, totally balanced and submodular delivery games
- The assignment game. I: The core
- Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- Minimum cost spanning tree games
- On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
- On cost allocation for a spanning tree: A game theoretic approach
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- The Traveling Salesman Problem with Distances One and Two
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
This page was built for publication: Approximately fair cost allocation in metric traveling salesman games
