Algorithmic Cost Allocation Games: Theory and Applications

DOI10.1007/978-3-642-29210-1_95zbMath1306.91030OpenAlexW1545822270MaRDI QIDQ5176374

Nam Dũng Hoàng

Publication date: 3 March 2015

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: http://depositonce.tu-berlin.de/handle/11303/2910

Mathematics Subject Classification ID

Integer programming (90C10) Cooperative games (91A12) Linear programming (90C05) Applications of game theory (91A80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• Geometric algorithms and combinatorial optimization.
• Note on the computational complexity of least core concepts for min-cost spanning tree games.
• On the computation of the nucleolus of a cooperative game
• Computing the nucleolus when the characteristic function is given implicitly: A constraint generation approach
• On the Significance of Solving Linear Programming Problems with Some Integer Variables

This page was built for publication: Algorithmic Cost Allocation Games: Theory and Applications