Sharing supermodular costs

DOI10.1287/OPRE.1100.0841MaRDI QIDQ3098296zbMATH OpenOpenAlexFDO

Authors Andreas S. Schulz, Nelson A. Uhan

Publication date 17 November 2011

Published in Operations Research (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.1058

zbMATH Keywords

computational complexitycombinatoricscooperative games

Mathematics Subject Classification ID

Cooperative games (91A12) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Encouraging Cooperation in Sharing Supermodular Costs
• Approximating the least core value and least core of cooperative games with supermodular costs
• Computing Shapley Value in Supermodular Coalitional Games
• Note on the computational complexity of least core concepts for min-cost spanning tree games.
• Some Results in Cost Allocation Games

Cited in

(11)

• Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games
• Algorithmic solutions for maximizing shareable costs
• Computing near-optimal stable cost allocations for cooperative games by Lagrangian relaxation
• Simultaneous penalization and subsidization for stabilizing grand cooperation
• An experiment on the Nash program: a comparison of two strategic mechanisms implementing the Shapley value
• Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner
• Capacity allocation games without an initial sequence
• Approximating the least core value and least core of cooperative games with supermodular costs
• Stochastic linear programming games with concave preferences
• Finding the nucleoli of large cooperative games
• Encouraging Cooperation in Sharing Supermodular Costs

This page was built for publication: Sharing supermodular costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3098296)