Sharing Supermodular Costs
From MaRDI portal
Publication:3098296
DOI10.1287/opre.1100.0841zbMath1232.91033OpenAlexW2149924219MaRDI QIDQ3098296
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
Abstract computational complexity for mathematical programming problems (90C60) Cooperative games (91A12)
Related Items (9)
Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games ⋮ Stochastic linear programming games with concave preferences ⋮ Finding the nucleoli of large cooperative games ⋮ Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner ⋮ Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation ⋮ An experiment on the Nash program: a comparison of two strategic mechanisms implementing the Shapley value ⋮ Capacity allocation games without an initial sequence ⋮ Approximating the least core value and least core of cooperative games with supermodular costs ⋮ Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation
This page was built for publication: Sharing Supermodular Costs
