This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Efficient Computation of Equilibria for Extensive Two-Person Games

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Koller, Daphne
Megiddo, Nimrod
von Stengel, Bernhard

Additional information is available for the following registered author(s):

Abstract

No abstract is available for this item.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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://www.sciencedirect.com/science/article/B6WFW-45MH07T-22/2/1b86b6ac81069a5033227c9419b4a14a
File Format:
File Function:
Download Restriction: Full text for ScienceDirect subscribers only

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.

Publisher Info
Article provided by Elsevier in its journal Games and Economic Behavior.

Volume (Year): 14 (1996)
Issue (Month): 2 (June)
Pages: 247-259
Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Handle: RePEc:eee:gamebe:v:14:y:1996:i:2:p:247-259

Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836

For technical questions regarding this item, or to correct its listing, contact: (Heidi Boesdal).

Related research
Keywords:

Cited by:
(explanations, 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.)

  1. F. Forges & B. von Stengel, 2002. "Computionally Efficient Coordination in Games Trees," THEMA Working Papers 2002-05, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise. [Downloadable!]
  2. Dinko Dimitrov & Shao-Chin Sung, 2008. "Computational Complexity in Additive Hedonic Games," Working Papers 2008.98, Fondazione Eni Enrico Mattei. [Downloadable!]
    Other versions:
  3. Kolen, Antoon, 2006. "A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem," Research Memoranda 045, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization. [Downloadable!]
  4. Rajgopal Kannan & Sudipta Sarangi & S. S. Iyengar, 2002. "Strategic Path Reliability in Information Networks," Discussion Papers of DIW Berlin 298, DIW Berlin, German Institute for Economic Research. [Downloadable!]
  5. Govindan, Srihari & Wilson, Robert B., 2007. "Stable Outcomes of Generic Games in Extensive Form," Research Papers 1933r, Stanford University, Graduate School of Business. [Downloadable!]
  6. Richard Baron & Jacques Durieu & Hans Haller & Rahul Savani & Philippe Solal, 2008. "Good neighbors are hard to find: computational complexity of network formation," Review of Economic Design, Springer, vol. 12(1), pages 1-19, April. [Downloadable!] (restricted)
Statistics
Access and download statistics

Did you know? You can use IDEAS to provide links to papers and articles in your course syllabus.

This page was last updated on 2009-12-3.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.