Network Games with Atomic Players

DOI10.1007/11786986_46zbMath1223.91013OpenAlexW1540416954MaRDI QIDQ3613787

José R. Correa, Nicolás E. Stier-Moses, Roberto Cominetti

Publication date: 12 March 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/178804

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) Applications of game theory (91A80)

Related Items (11)

Using inverse optimization to learn cost functions in generalized Nash games ⋮ Approximating Wardrop equilibria with finitely many agents ⋮ Tight bounds for selfish and greedy load balancing ⋮ Distributed Learning of Wardrop Equilibria ⋮ The price of atomic selfish ring routing ⋮ Stackelberg Strategies and Collusion in Network Games with Splittable Flow ⋮ Connections between mean-field game and social welfare optimization ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ Nonadaptive Selfish Routing with Online Demands ⋮ Management of Variable Data Streams in Networks ⋮ Balancing Load via Small Coalitions in Selfish Ring Routing Games

This page was built for publication: Network Games with Atomic Players