Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games

DOI10.1007/978-3-642-32589-2_60zbMath1366.91037OpenAlexW161648061MaRDI QIDQ2912767

Jan Christoph Schlegel, Matúš Mihalák

Publication date: 25 September 2012

Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32589-2_60

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43)

Related Items (13)

Efficient Equilibrium Concepts in Non-cooperative Network Formation ⋮ The price of anarchy in network creation games is (mostly) constant ⋮ On the Tree Conjecture for the Network Creation Game ⋮ Network Creation Games: Think Global – Act Local ⋮ Geometric Network Creation Games ⋮ On the PoA Conjecture: Trees versus Biconnected Components ⋮ The Impact of Cooperation in Bilateral Network Creation ⋮ On network formation games with heterogeneous players and basic network creation games ⋮ On the tree conjecture for the network creation game ⋮ The max-distance network creation game on general host graphs ⋮ On Network Formation Games with Heterogeneous Players and Basic Network Creation Games ⋮ Inequality and Network Formation Games ⋮ On the structure of equilibria in basic network formation

This page was built for publication: Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games