SZodixStudyAcademic Library

Shelves Open access

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

Which Is the Worst-Case Nash Equilibrium? · Study

WorkWhich Is the Worst-Case Nash Equilibrium?

Thomas Lücking2003

Work2003

Which Is the Worst-Case Nash Equilibrium?

Thomas Lücking · Marios Mavronicolas B · Burkhard Monien · Manuel Rode · Paul Spirakis · Imrich Vrt’o

47 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 Transportation Planning and Optimization Complexity and Algorithms in Graphs

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

References

1950Equilibrium points in n -person games 1951Non-Cooperative Games 1989Non-cooperative games 1994A Course in Game Theory 1999Worst-Case Equilibria 2001Algorithms, games, and the internet 1978Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon 2002The Structure and Complexity of Nash Equilibria for a Selfish Routing Game

Cited by

2004Selfish Unsplittable Flows

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 · 10 shared references 2008A new model for selfish routingarticle · 9 shared references 2007The Price of Selfish Routingarticle · 8 shared references 2004Nash Equilibria in Discrete Routing Games with Convex Latency Functionsother · 8 shared references 2003Selfish Routing in Non-cooperative Networks: A Surveyother · 8 shared references 2003Nashification and the Coordination Ratio for a Selfish Routing Gameother · 7 shared references

Details

Year2003

Typeother

Published2003-01-01

VenueLecture notes in computer science

ISSN-L0302-9743

Languageen

Citations47

Files0 public / 0

ShelfGame Theory and Applications

Identifiers

doi10.1007/978-3-540-45138-9_49

openalex_workW1518233575

Links

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