Pure Nash equilibria in restricted budget games
From MaRDI portal
Publication:5971178
DOI10.1007/s10878-018-0269-7zbMath1422.91054OpenAlexW2789588151MaRDI QIDQ5971178
Alexander Skopalik, Maximilian Drees, Matthias Feldotto, Sören Riechers
Publication date: 6 June 2019
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-018-0269-7
Noncooperative games (91A10) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Convergence to approximate Nash equilibria in congestion games
- Pure Nash equilibria in player-specific and weighted congestion games
- Potential games
- Congestion games with player-specific payoff functions
- A class of games possessing pure-strategy Nash equilibria
- Congestion Games with Variable Demands
- Congestion Games with Player-Specific Costs Revisited
- Budget-Restricted Utility Games with Ordered Strategic Decisions
- Approximate Pure Nash Equilibria in Weighted Congestion Games
- Restoring Pure Equilibria to Weighted Congestion Games
- The Price of Stability for Network Design with Fair Cost Allocation
- On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
- Congestion Games with Player-Specific Constants
- Games with Congestion-Averse Utilities
- Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games
- On the Existence of Pure Nash Equilibria in Weighted Congestion Games
This page was built for publication: Pure Nash equilibria in restricted budget games