A common generalization of budget games and congestion games

DOI10.1007/978-3-031-15714-1_15zbMath1520.91017OpenAlexW4297821569MaRDI QIDQ6109524

Fuga Kiyosue, Kenjiro Takazawa

Publication date: 28 July 2023

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-15714-1_15

zbMATH Keywords

noncooperative gamematroidpure Nash equilibrium

Mathematics Subject Classification ID

Noncooperative games (91A10) 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

This page was built for publication: A common generalization of budget games and congestion games