Resource buying games
From MaRDI portal
Publication:487012
DOI10.1007/s00453-014-9876-6zbMath1303.91050arXiv1204.4111OpenAlexW2102728684MaRDI QIDQ487012
Publication date: 19 January 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.4111
Games involving graphs (91A43) Applications of game theory (91A80) Combinatorial aspects of matroids and geometric lattices (05B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items
Unnamed Item, Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function, A Characterization of Undirected Graphs Admitting Optimal Cost Shares, Efficiency of Equilibria in Uniform Matroid Congestion Games, Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games, Efficient Black-Box Reductions for Separable Cost Sharing
Cites Work
- Unnamed Item
- Price of stability in survivable network design
- Exact and approximate equilibria for optimal group network formation
- Strong equilibrium in cost sharing connection games
- Non-cooperative facility location and covering games
- Pure Nash equilibria in player-specific and weighted congestion games
- Non-cooperative tree creation
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Strategic cooperation in cost sharing games
- Strategic multiway cut and multicut games
- A class of games possessing pure-strategy Nash equilibria
- Terminal Backup, 3D Matching, and Covering Cubic Graphs
- On the Complexity of Pareto-optimal Nash and Strong Equilibria
- On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
- On the impact of combinatorial structure on congestion games
- The complexity of pure Nash equilibria
- Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games
- On the Existence of Pure Nash Equilibria in Weighted Congestion Games
