On the existence of pure strategy Nash equilibria in integer-splittable weighted congestion games

DOI10.1007/978-3-642-24829-0_22MaRDI QIDQ3095277zbMATH OpenOpenAlexFDO

Authors Long Tran-Thanh, Maria Polukarov, Archie C. Chapman, Alex Rogers, Nicholas R. Jennings

Publication date 28 October 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-24829-0_22

Mathematics Subject Classification ID

Applications of game theory (91A80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Noncooperative games (91A10)

Recommendations

• On the complexity of pure-strategy Nash equilibria in congestion and local-effect games
• On the existence of pure Nash equilibria in weighted congestion games
• On the existence of pure Nash equilibria in weighted congestion games
• Congestion games with player-specific costs revisited
• Congestion Games with Multi-Dimensional Demands

Cited in

(8)

• Congestion games with variable demands
• Cost-sharing in generalised selfish routing
• Efficiency of equilibria in uniform matroid congestion games
• Non-cooperative queueing games on a network of single server queues
• Sensitivity analysis for convex separable optimization over integral polymatroids
• Equilibrium computation in resource allocation games
• Weakly-acyclic (internet) routing games
• Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function

This page was built for publication: On the existence of pure strategy Nash equilibria in integer-splittable weighted congestion games

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