Computing and Combinatorics

DOI10.1007/11533719zbMath1128.68302OpenAlexW4376561447MaRDI QIDQ5716934

Piotr Krysta, Martin Hoefer

Publication date: 11 January 2006

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

Full work available at URL: https://doi.org/10.1007/11533719

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Games involving graphs (91A43)

Related Items (10)

Strategic cooperation in cost sharing games ⋮ Geometric Network Creation Games ⋮ Friend of my friend: network formation with two-hop benefit ⋮ Strategic multiway cut and multicut games ⋮ Price of stability in survivable network design ⋮ Non-cooperative facility location and covering games ⋮ Exact and approximate equilibria for optimal group network formation ⋮ Non-cooperative tree creation ⋮ Geometric spanner games ⋮ Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games

This page was built for publication: Computing and Combinatorics