Pure Nash equilibria in weighted matroid congestion games with non-additive aggregation and beyond
From MaRDI portal
Publication:6657230
DOI10.1016/j.dam.2024.10.017MaRDI QIDQ6657230
Publication date: 6 January 2025
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Computing pure Nash and strong equilibria in bottleneck congestion games
- Social context congestion games
- Strong Nash equilibrium in games with common and complementary local utilities
- Inefficiency of games with social context
- Pure Nash equilibria in player-specific and weighted congestion games
- Congestion games with mixed objectives
- A universal construction generating potential games
- Potential games
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Strong equilibria in games with the lexicographical improvement property
- Congestion games revisited
- A class of games possessing pure-strategy Nash equilibria
- On Linear Congestion Games with Altruistic Social Context
- On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
- Congestion Games with Complementarities
- Comments on bases in dependence structures
- Twenty Lectures on Algorithmic Game Theory
- Matrices and matroids for systems analysis
- Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function
- Pure Nash equilibria in restricted budget games
- Coping with selfishness in congestion games. Analysis and design via LP duality
- A common generalization of budget games and congestion games
This page was built for publication: Pure Nash equilibria in weighted matroid congestion games with non-additive aggregation and beyond
