On the Existence of Pure Strategy Nash Equilibria in Integer–Splittable Weighted Congestion Games
From MaRDI portal
Publication:3095277
DOI10.1007/978-3-642-24829-0_22zbMath1233.91072MaRDI QIDQ3095277
Alex Rogers, Maria Polukarov, Long Tran-Thanh, Nicholas R. Jennings, Archie C. Chapman
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
91A10: Noncooperative games
91A80: Applications of game theory
91B32: Resource and cost allocation (including fair division, apportionment, etc.)
Related Items
Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids, Cost-Sharing in Generalised Selfish Routing, Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function, Weakly-acyclic (internet) routing games, Non-cooperative queueing games on a network of single server queues, Equilibrium computation in resource allocation games, Congestion Games with Variable Demands, Efficiency of Equilibria in Uniform Matroid Congestion Games