SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations · Study

WorkOn the Price of Stability for Designing Undirected Networks with Fair Cost Allocations

Amos Fiat2006

Work2006

On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations

Amos Fiat · Haim Y. Kaplan · Meital Levy · Svetlana Olonetsky · Ronen Shabo

91 citations·0/0 files stored·Lecture notes in computer science

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Game Theory and Applications Complexity and Algorithms in Graphs Game Theory and Voting Systems

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 91 citations exist upstream.

References

1950Equilibrium points in n -person games 1996Potential Games 1973A class of games possessing pure-strategy Nash equilibria 1999Worst-Case Equilibria 2001Algorithms, games, and the internet 2003On a network creation game 2004The Price of Stability for Network Design with Fair Cost Allocation 2005The price of anarchy of finite congestion games

Cited by

2014Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games 2007Strong Price of Anarchy for Machine Load Balancing 2007Non-Cooperative Multicast and Facility Location Games 2010On the Performance of Approximate Equilibria in Congestion Games 2008Online multicast with egalitarian cost sharing 2007Designing networks with good equilibria 2006Non-cooperative multicast and facility location games

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

2004A New Model for Selfish Routingother · 13 shared references 2008A new model for selfish routingarticle · 13 shared references 2006Network design with weighted playersother · 13 shared references 2008Network Design with Weighted Playersarticle · 12 shared references 2008Strong equilibrium in cost sharing connection gamesarticle · 12 shared references 2006Exact Price of Anarchy for Polynomial Congestion Gamesother · 11 shared references

Details

Year2006

Typeother

Published2006-01-01

VenueLecture notes in computer science

ISSN-L0302-9743

Languageen

Citations91

Files0 public / 0

ShelfGame Theory and Applications

Identifiers

doi10.1007/11786986_53

openalex_workW1558409237

Links

Imported from OpenAlex (CC0) — nothing here is generated.

2012Improved Lower Bounds on the Price of Stability of Undirected Network Design Games