The Cost of Stability in Network Flow Games

DOI10.1007/978-3-642-03816-7_54zbMath1250.68121OpenAlexW1602541224MaRDI QIDQ3182962

Yoram Bachrach, Reshef Meir, Jeffrey S. Rosenschein, Ezra Resnick

Publication date: 16 October 2009

Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_54

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

Minimal Subsidies in Expense Sharing Games ⋮ Proof systems and transformation games ⋮ On \(\alpha\)-roughly weighted games ⋮ Computing cooperative solution concepts in coalitional skill games ⋮ Negotiating team formation using deep reinforcement learning ⋮ Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation

Cites Work

• Unnamed Item
• Unnamed Item
• On the computational complexity of weighted voting games
• Maximal Flow Through a Network
• A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications
• A New Solution Concept for Coalitional Games in Open Anonymous Environments
• The Cost of Stability in Coalitional Games
• Generalized Network Problems Yielding Totally Balanced Games
• Totally Balanced Games and Games of Flow
• The Nucleolus of a Characteristic Function Game

This page was built for publication: The Cost of Stability in Network Flow Games