On the Existence of Pure Strategy Nash Equilibria in Integer–Splittable Weighted Congestion Games

DOI10.1007/978-3-642-24829-0_22zbMath1233.91072OpenAlexW196481494MaRDI 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

Mathematics Subject Classification ID

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

Related Items (8)

Cost-Sharing in Generalised Selfish Routing ⋮ Equilibrium computation in resource allocation games ⋮ Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids ⋮ Weakly-acyclic (internet) routing games ⋮ Congestion Games with Variable Demands ⋮ Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function ⋮ Non-cooperative queueing games on a network of single server queues ⋮ Efficiency of Equilibria in Uniform Matroid Congestion Games

This page was built for publication: On the Existence of Pure Strategy Nash Equilibria in Integer–Splittable Weighted Congestion Games