Advanced Search
MyIDEAS: Login

Computing equilibria: a computational complexity perspective

Contents:

Author Info

  • Tim Roughgarden

    ()

Registered author(s):

    Abstract

    No abstract is available for this item.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://hdl.handle.net/10.1007/s00199-009-0448-y
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Springer in its journal Economic Theory.

    Volume (Year): 42 (2010)
    Issue (Month): 1 (January)
    Pages: 193-236

    as in new window
    Handle: RePEc:spr:joecth:v:42:y:2010:i:1:p:193-236

    Contact details of provider:
    Web page: http://link.springer.de/link/service/journals/00199/index.htm

    Order Information:
    Web: http://link.springer.de/orders.htm

    Related research

    Keywords: Equilibrium computation; Computational complexity; NP-completeness; PPAD-completeness; C61; C63; C68;

    Find related papers by JEL classification:

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. Peter Cramton & Yoav Shoham & Richard Steinberg, 2004. "Combinatorial Auctions," Papers of Peter Cramton 04mit, University of Maryland, Department of Economics - Peter Cramton, revised 2004.
    2. S. Hart & A. Mas-Collel, 2010. "A Simple Adaptive Procedure Leading to Correlated Equilibrium," Levine's Working Paper Archive 572, David K. Levine.
    3. Eaves, B. Curtis & Schmedders, Karl, 1999. "General equilibrium models and homotopy methods," Journal of Economic Dynamics and Control, Elsevier, vol. 23(9-10), pages 1249-1279, September.
    4. Aumann, Robert J., 1974. "Subjectivity and correlation in randomized strategies," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 67-96, March.
    5. Sergiu Hart & Yishay Mansour, 2006. "The Communication Complexity of Uncoupled Nash Equilibrium Procedures," Discussion Paper Series dp419, The Center for the Study of Rationality, Hebrew University, Jerusalem.
    6. Sergiu Hart, 2004. "Adaptive Heuristics," Levine's Bibliography 122247000000000471, UCLA Department of Economics.
    7. Itzhak Gilboa & Ehud Kalai & Eitan Zemel, 1989. "The Complexity of Eliminating Dominated Strategies," Discussion Papers 853, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    8. Bona, Jerry L. & Santos, Manuel S., 1997. "On the Role of Computation in Economic Theory," Journal of Economic Theory, Elsevier, vol. 72(2), pages 241-281, February.
    9. Koller, Daphne & Megiddo, Nimrod, 1992. "The complexity of two-person zero-sum games in extensive form," Games and Economic Behavior, Elsevier, vol. 4(4), pages 528-552, October.
    10. Sandholm, William H., 2001. "Potential Games with Continuous Player Sets," Journal of Economic Theory, Elsevier, vol. 97(1), pages 81-108, March.
    11. Itzhak Gilboa & Eitan Zemel, 1988. "Nash and Correlated Equilibria: Some Complexity Considerations," Discussion Papers 777, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    12. Judd, Kenneth L., 1997. "Computational economics and economic theory: Substitutes or complements?," Journal of Economic Dynamics and Control, Elsevier, vol. 21(6), pages 907-942, June.
    13. Gilboa, Itzhak, 1988. "The complexity of computing best-response automata in repeated games," Journal of Economic Theory, Elsevier, vol. 45(2), pages 342-352, August.
    14. Rahul Savani & Bernhard Stengel, 2006. "Hard-to-Solve Bimatrix Games," Econometrica, Econometric Society, vol. 74(2), pages 397-429, 03.
    15. Francis C. Chu & Joseph Y. Halpern, 2000. "On the NP-Completeness of Finding an Optimal Strategy in Games with Common Payoffs," Game Theory and Information 0004011, EconWPA.
    16. Ehud Kalai, 1987. "Bounded Rationality and Strategic Complexity in Repeated Games," Discussion Papers 783, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    17. McLennan, Andrew & Tourky, Rabee, 2010. "Simple complexity from imitation games," Games and Economic Behavior, Elsevier, vol. 68(2), pages 683-688, March.
    18. Thomas Quint & Martin Shubik, 1994. "A Model of Migration," Cowles Foundation Discussion Papers 1088, Cowles Foundation for Research in Economics, Yale University.
    19. Roth, Alvin E, 1984. "The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory," Journal of Political Economy, University of Chicago Press, vol. 92(6), pages 991-1016, December.
    20. Herbert E. Scarf, 1967. "The Approximation of Fixed Points of a Continuous Mapping," Cowles Foundation Discussion Papers 216R, Cowles Foundation for Research in Economics, Yale University.
    21. McKelvey, Richard D. & McLennan, Andrew, 1996. "Computation of equilibria in finite games," Handbook of Computational Economics, in: H. M. Amman & D. A. Kendrick & J. Rust (ed.), Handbook of Computational Economics, edition 1, volume 1, chapter 2, pages 87-142 Elsevier.
    22. Foster, Dean P. & Vohra, Rakesh V., 1997. "Calibrated Learning and Correlated Equilibrium," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 40-55, October.
    23. Hans M. Amman & David A. Kendrick, . "Computational Economics," Online economics textbooks, SUNY-Oswego, Department of Economics, number comp1, January.
    24. Babaioff, Moshe & Feldman, Michal & Nisan, Noam & Winter, Eyal, 2012. "Combinatorial agency," Journal of Economic Theory, Elsevier, vol. 147(3), pages 999-1034.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Aziz, Haris & Brandt, Felix & Harrenstein, Paul, 2013. "Pareto optimality in coalition formation," Games and Economic Behavior, Elsevier, vol. 82(C), pages 562-581.
    2. Bernhard Stengel, 2010. "Computation of Nash equilibria in finite games: introduction to the symposium," Economic Theory, Springer, vol. 42(1), pages 1-7, January.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:42:y:2010:i:1:p:193-236. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.