How long to Pareto efficiency?

Yakov Babichenko ()

International Journal of Game Theory, 2014, vol. 43, issue 1, 13-24

Abstract: We consider uncoupled dynamics (each player knows only his own payoff function) that reach outcomes that are Pareto efficient and individually rational. We show that in the worst case the number of periods it takes to reach these outcomes must be exponential in the number of players and hence the same number of periods it takes to reach Nash equilibria. For social welfare maximizing outcomes we provide a tight bound on the minimal number of steps required for reaching such an outcome by uncoupled dynamics. Copyright Springer-Verlag Berlin Heidelberg 2014

Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s00182-013-0365-y (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jogath:v:43:y:2014:i:1:p:13-24

Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/182/PS2

DOI: 10.1007/s00182-013-0365-y

Access Statistics for this article

International Journal of Game Theory is currently edited by Shmuel Zamir, Vijay Krishna and Bernhard von Stengel

More articles in International Journal of Game Theory from Springer, Game Theory Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().