Pure Nash equilibria in weighted matroid congestion games with non-additive aggregation and beyond

DOI10.1016/J.DAM.2024.10.017MaRDI QIDQ6657230zbMATH OpenFDO

Authors Kenjiro Takazawa

Publication date 6 January 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

matroidpure Nash equilibriumcongestion gamenon-cooperative game theory

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Noncooperative games (91A10) General equilibrium theory (91B50)

Recommendations

• Pure Nash equilibria in player-specific and weighted congestion games
• Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function
• Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function
• On the existence of pure Nash equilibria in weighted congestion games
• On the existence of pure Nash equilibria in weighted congestion games

Cites work

• scientific article; zbMATH DE number 3139273 (Why is no real title available?)
• scientific article; zbMATH DE number 50766 (Why is no real title available?)
• A class of games possessing pure-strategy Nash equilibria
• A common generalization of budget games and congestion games
• A universal construction generating potential games
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Comments on bases in dependence structures
• Computing pure Nash and strong equilibria in bottleneck congestion games
• Congestion games revisited
• Congestion games with complementarities
• Congestion games with mixed objectives
• Coping with selfishness in congestion games. Analysis and design via LP duality
• Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function
• Inefficiency of games with social context
• Matrices and matroids for systems analysis
• On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
• On linear congestion games with altruistic social context
• Potential games
• Pure Nash equilibria in player-specific and weighted congestion games
• Pure Nash equilibria in restricted budget games
• Social context congestion games
• Strong Nash equilibrium in games with common and complementary local utilities
• Strong equilibria in games with the lexicographical improvement property
• Twenty lectures on algorithmic game theory

This page was built for publication: Pure Nash equilibria in weighted matroid congestion games with non-additive aggregation and beyond

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657230)