SZodixStudyAcademic Library

Shelves Open access

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

The price of anarchy in an exponential multi-server · Study

ArticleShelves

ArticleThe price of anarchy in an exponential multi-server

Moshe Haviv2007

Article2007

The price of anarchy in an exponential multi-server

Moshe Haviv · Tim Roughgarden

75 citations·0/0 files stored·Operations Research Letters

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

Advanced Queuing Theory Analysis Game Theory and Applications Optimization and Search Problems

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

References

1986Urban transportation networks: Equilibrium analysis with mathematical programming methods 1999Worst-Case Equilibria 2001Algorithms, games, and the internet 2003To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems 1969Traffic assignment problem for a general network 2006Selfish Routing and the Price of Anarchy 2016Selfish Routing and the Price of Anarchy 2003The price of anarchy is independent of the network topology

Cited by

2010The concert queueing game: to wait or to be late 2015Customer equilibrium and optimal strategies in an M/M/1 queue with dynamic service control 2016Optimal Cost-Sharing in General Resource Selection Games 2013The Price of Anarchy in the Markovian Single Server Queue 2012Minimizing slowdown in heterogeneous size-aware dispatching systems 2011M/M/1-PS queue and size-aware task assignment

Related works

Explore the map →

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

2005How much can taxes help selfish routing?article · 6 shared references 2010On the Performance of Approximate Equilibria in Congestion Gamesarticle · 6 shared references 2015Mechanisms that govern how the Price of Anarchy varies with travel demandarticle · 6 shared references 2013A heuristic methodology to tackle the Braess Paradox detecting problem tailored for real road networksarticle · 6 shared references 2008A new model for selfish routingarticle · 5 shared references 2009Bounding the inefficiency of logit-based stochastic user equilibriumarticle · 5 shared references

Details

Year2007

Typearticle

Published2007-01-05

VenueOperations Research Letters

ISSN-L0167-6377

Languageen

Citations75

Files0 public / 0

ShelfAdvanced Queuing Theory Analysis

Identifiers

doi10.1016/j.orl.2006.09.005

openalex_workW2103024660

Links

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

2010

Optimal routing in parallel, non-observable queues and the price of anarchy revisited

2021Inefficiency in stochastic queueing systems with strategic customers