New techniques for cost sharing in combinatorial optimization games
From MaRDI portal
Publication:2638367
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
Cites work
- scientific article; zbMATH DE number 3139280 (Why is no real title available?)
- scientific article; zbMATH DE number 3728302 (Why is no real title available?)
- scientific article; zbMATH DE number 3750720 (Why is no real title available?)
- scientific article; zbMATH DE number 2064405 (Why is no real title available?)
- scientific article; zbMATH DE number 1749223 (Why is no real title available?)
- scientific article; zbMATH DE number 1929535 (Why is no real title available?)
- A result on projection for the vehicle routing problem
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Approximately fair cost allocation in metric traveling salesman games
- Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
- Cooperative facility location games
- Cost sharing
- Decomposition Principle for Linear Programs
- Geometric algorithms and combinatorial optimization
- Integer Programming and Combinatorial Optimization
- Maximum matching and a polyhedron with 0,1-vertices
- Minimum cost spanning tree games
- Multistars, partial multistars and the capacitated vehicle routing problem
- Odd Minimum Cut-Sets and b-Matchings
- On approximately fair cost allocation in Euclidean TSP games
- On the core of a traveling salesman cost allocation game
- On the nucleolus of the basic vehicle routing game
- On the symmetric travelling salesman problem I: Inequalities
- Projection results for vehicle routing
- The Circuit Polytope: Facets
- The assignment game. I: The core
- The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
- Theory of games and economic behavior.
- Traveling salesman games
- Traveling salesman games with the Monge property
- Traveling the boundary of Minkowski sums.
Cited in
(17)- Open problems in cooperative location games
- Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games
- The worst-case efficiency of cost sharing methods in resource allocation games
- A cooperative location game based on the 1-center location problem
- Designing cost-sharing methods for Bayesian games
- Using \(\ell^p\)-norms for fairness in combinatorial optimisation
- A competitive solution for cooperative truckload delivery
- Algorithmic solutions for maximizing shareable costs
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
- Computing near-optimal stable cost allocations for cooperative games by Lagrangian relaxation
- Simultaneous penalization and subsidization for stabilizing grand cooperation
- A review on cost allocation methods in collaborative transportation
- Cost sharing and strategyproof mechanisms for set cover games
- Carrier collaboration with the simultaneous presence of transferable and non-transferable utilities
- Stochastic linear programming games with concave preferences
- Finding the nucleoli of large cooperative games
- Allocating costs in set covering problems
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)
