Encouraging Cooperation in Sharing Supermodular Costs

DOI10.1007/978-3-540-74208-1_20zbMATH Open1171.91314OpenAlexW3121582342MaRDI QIDQ3603471FDOQ3603471

Authors: Andreas S. Schulz, Nelson A. Uhan 

Publication date: 17 February 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74208-1_20

Recommendations

• Sharing supermodular costs
• Approximating the least core value and least core of cooperative games with supermodular costs
• Note on the computational complexity of least core concepts for min-cost spanning tree games.
• Computing Shapley Value in Supermodular Coalitional Games
• Algorithmic Cooperative Game Theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Cooperative games (91A12) Approximation algorithms (68W25)

Cited In (1)

• Inventory allocation with full downward substitution and monotone cost differences

This page was built for publication: Encouraging Cooperation in Sharing Supermodular Costs

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