A common generalization of budget games and congestion games
From MaRDI portal
Publication:6646744
DOI10.1007/s10878-024-01218-7MaRDI QIDQ6646744
Fuga Kiyosue, Kenjiro Takazawa
Publication date: 3 December 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Combinatorial optimization (90C27) Mathematical programming (90Cxx) Potential and congestion games (91A14) Algorithmic game theory and complexity (91A68)
Cites Work
- Pure Nash equilibria in player-specific and weighted congestion games
- Congestion games viewed from M-convexity
- Potential games
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Strong equilibria in games with the lexicographical improvement property
- A class of games possessing pure-strategy Nash equilibria
- Budget-Restricted Utility Games with Ordered Strategic Decisions
- On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
- Discrete Convex Analysis
- Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids
- Matroids Are Immune to Braess’ Paradox
- Twenty Lectures on Algorithmic Game Theory
- Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function
- Pure Nash equilibria in restricted budget games
Related Items (1)
This page was built for publication: A common generalization of budget games and congestion games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646744)
