SZodixStudyAcademic Library

Shelves Open access

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

The Complexity of Equilibria in Cost Sharing Games · Study

WorkThe Complexity of Equilibria in Cost Sharing Games

Vasilis Syrgkanis2010

Work2010

The Complexity of Equilibria in Cost Sharing Games

Vasilis Syrgkanis

38 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 — 38 citations exist upstream.

References

1973A class of games possessing pure-strategy Nash equilibria 2004The complexity of pure Nash equilibria 2004The Price of Stability for Network Design with Fair Cost Allocation 2006On the Impact of Combinatorial Structure on Congestion Games 2005Fast and compact: a simple class of congestion games 2008Inapproximability of pure nash equilibria 2007Strong equilibrium in cost sharing connection games 2007Non-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.

2011Efficient Computation of Approximate Pure Nash Equilibria in Congestion Gamesother · 6 shared references 2012The curse of simultaneityother · 6 shared references 2009Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchyarticle · 6 shared references 2008Pure Nash equilibria in player-specific and weighted congestion gamesarticle · 5 shared references 2009Altruism in Atomic Congestion Gamesother · 5 shared references 2010Approximating pure nash equilibrium in cut, party affiliation, and satisfiability gamesother · 5 shared references

Details

Year2010

Typeother

Published2010-01-01

VenueLecture notes in computer science

ISSN-L0302-9743

Languageen

Citations38

Files0 public / 0

ShelfGame Theory and Applications

Identifiers

doi10.1007/978-3-642-17572-5_30

openalex_workW1870956571

Links

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