Algorithmic solutions for maximizing shareable costs

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Core extensions for non-balanced TU-games
Merge-proofness in minimum cost spanning tree problems
Cooperative games with restricted formation of coalitions
Complexity of core allocation for the bin packing game
Approximately fair cost allocation in metric traveling salesman games
The ellipsoid method and its consequences in combinatorial optimization
Population monotonic allocation schemes for cooperative games with transferable utility
On the complexity of testing membership in the core of min-cost spanning tree games
On approximately fair cost allocation in Euclidean TSP games
Note on the computational complexity of least core concepts for min-cost spanning tree games.
Minimum cost spanning tree games and population monotonic allocation schemes.
Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games
The subcoalition-perfect core of cooperative games
Characteristic function games with restricted agent interactions: core-stability and coalition structures
New techniques for cost sharing in combinatorial optimization games
Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation
Sharing Supermodular Costs
On some approximately balanced combinatorial cooperative games
Minimal Subsidies in Expense Sharing Games
The Cost of Stability in Network Flow Games
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
The Cost of Stability in Coalitional Games
Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
Minimum cost spanning tree games
Cost allocation for a spanning tree
On cost allocation for a spanning tree: A game theoretic approach
Graphs and Cooperation in Games
On the Complexity of Cooperative Solution Concepts
Bounds on the Cost of Stabilizing a Cooperative Game
Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation
Quasi-Cores in a Monetary Economy with Nonconvex Preferences
Matching Games: The Least Core and the Nucleolus
An efficient characterization of submodular spanning tree games
Strategyproof sharing of submodular costs: budget balance versus efficiency

This page was built for publication: Algorithmic solutions for maximizing shareable costs