Algorithmic solutions for maximizing shareable costs
From MaRDI portal
Recommendations
- Cost sharing in networks: some open questions
- Algorithmic cost allocation games: theory and applications
- Note on the computational complexity of least core concepts for min-cost spanning tree games.
- Computing near-optimal stable cost allocations for cooperative games by Lagrangian relaxation
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
Cites work
- A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
- An efficient characterization of submodular spanning tree games
- Approximately fair cost allocation in metric traveling salesman games
- Bounds on the cost of stabilizing a cooperative game
- Characteristic function games with restricted agent interactions: core-stability and coalition structures
- Complexity of core allocation for the bin packing game
- Computing near-optimal stable cost allocations for cooperative games by Lagrangian relaxation
- Cooperative games with restricted formation of coalitions
- Core extensions for non-balanced TU-games
- Cost allocation for a spanning tree
- Cost sharing
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- Graphs and Cooperation in Games
- scientific article; zbMATH DE number 3139280 (Why is no real title available?)
- scientific article; zbMATH DE number 1302180 (Why is no real title available?)
- scientific article; zbMATH DE number 1929535 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- scientific article; zbMATH DE number 970005 (Why is no real title available?)
- Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games
- Matching Games: The Least Core and the Nucleolus
- Merge-proofness in minimum cost spanning tree problems
- Minimal subsidies in expense sharing games
- Minimum cost spanning tree games
- Minimum cost spanning tree games and population monotonic allocation schemes.
- New techniques for cost sharing in combinatorial optimization games
- Note on the computational complexity of least core concepts for min-cost spanning tree games.
- On approximately fair cost allocation in Euclidean TSP games
- On cost allocation for a spanning tree: A game theoretic approach
- On some approximately balanced combinatorial cooperative games
- On the Complexity of Cooperative Solution Concepts
- On the complexity of testing membership in the core of min-cost spanning tree games
- Population monotonic allocation schemes for cooperative games with transferable utility
- Quasi-Cores in a Monetary Economy with Nonconvex Preferences
- Sharing supermodular costs
- Simultaneous penalization and subsidization for stabilizing grand cooperation
- Strategyproof sharing of submodular costs: budget balance versus efficiency
- The cost of stability in coalitional games
- The Cost of Stability in Network Flow Games
- The ellipsoid method and its consequences in combinatorial optimization
- The subcoalition-perfect core of cooperative games
This page was built for publication: Algorithmic solutions for maximizing shareable costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659082)
