Altruism in Atomic Congestion Games

DOI10.1007/978-3-642-04128-0_16zbMath1256.91008OpenAlexW1516648639MaRDI QIDQ3639245

Martin Hoefer, Alexander Skopalik

Publication date: 29 October 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Games involving graphs (91A43) (n)-person games, (n>2) (91A06)

Related Items (9)

Altruistic Hedonic Games ⋮ Stable matching with network externalities ⋮ Additively separable hedonic games with social context ⋮ Friend of my friend: network formation with two-hop benefit ⋮ Inefficiency of games with social context ⋮ Graphical congestion games ⋮ Dynamics in matching and coalition formation games with structural constraints ⋮ Regulation under partial cooperation: the case of a queueing system ⋮ “Beat-Your-Rival” Routing Games

This page was built for publication: Altruism in Atomic Congestion Games