New techniques for cost sharing in combinatorial optimization games
DOI10.1007/S10107-010-0357-7zbMATH Open1194.91036OpenAlexW2163345326WikidataQ57702201 ScholiaQ57702201MaRDI QIDQ2638367FDOQ2638367
Authors: Alberto Caprara, Adam N. Letchford 
Publication date: 16 September 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/45297/1/10.pdf
Recommendations
- Cost Allocation in Combinatorial Optimization Games
- Optimal cost sharing for resource selection games
- An extension of a class of cost sharing methods to two-person cooperative games solutions
- Algorithmic cost allocation games: theory and applications
- Optimal cost-sharing in general resource selection games
- The worst-case efficiency of cost sharing methods in resource allocation games
- On cost sharing mechanisms in the network design game
- A cost-sharing method for an economic lot-sizing game
- scientific article; zbMATH DE number 7042522
cooperative gamesvalid inequalitiescombinatorial optimization gamestraveling salesman gameoptimal cost sharesvehicle routing game
Linear programming (90C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Cooperative games (91A12) Integer programming (90C10) Games on graphs (graph-theoretic aspects) (05C57) Combinatorial games (91A46)
Cites Work
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
- Theory of games and economic behavior.
- Traveling salesman games
- Geometric algorithms and combinatorial optimization
- The assignment game. I: The core
- Title not available (Why is that?)
- Minimum cost spanning tree games
- Title not available (Why is that?)
- Title not available (Why is that?)
- On approximately fair cost allocation in Euclidean TSP games
- Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
- On the symmetric travelling salesman problem I: Inequalities
- Cooperative facility location games
- Maximum matching and a polyhedron with 0,1-vertices
- Title not available (Why is that?)
- Multistars, partial multistars and the capacitated vehicle routing problem
- Decomposition Principle for Linear Programs
- A result on projection for the vehicle routing problem
- On the nucleolus of the basic vehicle routing game
- Projection results for vehicle routing
- Odd Minimum Cut-Sets and b-Matchings
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Title not available (Why is that?)
- On the core of a traveling salesman cost allocation game
- Traveling salesman games with the Monge property
- The Circuit Polytope: Facets
- The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
- Integer Programming and Combinatorial Optimization
- Approximately fair cost allocation in metric traveling salesman games
- Title not available (Why is that?)
- Cost sharing
- Traveling the boundary of Minkowski sums.
Cited In (17)
- Designing cost-sharing methods for Bayesian games
- A competitive solution for cooperative truckload delivery
- Using \(\ell^p\)-norms for fairness in combinatorial optimisation
- Simultaneous penalization and subsidization for stabilizing grand cooperation
- Carrier collaboration with the simultaneous presence of transferable and non-transferable utilities
- Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
- Cost sharing and strategyproof mechanisms for set cover games
- Stochastic linear programming games with concave preferences
- Finding the nucleoli of large cooperative games
- Open problems in cooperative location games
- A cooperative location game based on the 1-center location problem
- Algorithmic solutions for maximizing shareable costs
- A review on cost allocation methods in collaborative transportation
- The worst-case efficiency of cost sharing methods in resource allocation games
- Computing near-optimal stable cost allocations for cooperative games by Lagrangian relaxation
- Allocating costs in set covering problems
Uses Software
This page was built for publication: New techniques for cost sharing in combinatorial optimization games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2638367)
