IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this paper

Further results on verification problems in extensive-form games

Listed author(s):
  • Nicola, Gatti
  • Mario, Gilli
  • Fabio, Panozzo

The computational study of games is receiving increasing attention both in game theory and computer science. The challenge is distinguishing computationally tractable problems (also said easy), admitting polynomial{time algorithms, from the intractable ones (also said hard). In this paper, we focus on extensive form games, as the computational problems defined on such games are largely unexplored. We study the problem (aka verification problem) of certifying that a solution given in input is an equilibrium according to different refinements for extensive form games as the input change. We show that, when the input is a realization plan strategy profile (i.e., strategies for the sequence form representation), deciding whether the input is a Subgame Perfect Equilibrium or is a part of a Sequential Equilibrium is NP-hard even in two-player games (we conjecture the same holds also for Quasi Perfect Equilibrium). This means that there is no polynomial-time algorithm unless P = NP, but it is commonly believed that P x NP. Subsequently, we show that in two{player games, when the input is a behavioral strategy profile, there is a polynomial-time algorithm deciding whether the input is a Quasi-Perfect Equilib- rium, and a simple variation of the algorithm decides whether the input is part of some Sequential Equilibrium (in games with three or more players, the problem is known to be NP{hard for both Quasi-Perfect Equilibrium and Sequential Equilibrium). Finally, we show that, when the input is an assessment, there is a polynomial{time algorithm deciding whether the input is a Sequential Equilibrium regardless the number of players.

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:
Download Restriction: no

Paper provided by University of Milano-Bicocca, Department of Economics in its series Working Papers with number 347.

in new window

Length: 49
Date of creation: 15 Jul 2016
Date of revision: 15 Jul 2016
Handle: RePEc:mib:wpaper:347
Contact details of provider: Postal:
Piazza Ateneo Nuovo, 1 Milano 20126

Phone: +39 02 6448 3089
Fax: +39 02 6448 3085
Web page:

More information through EDIRC

No references listed on IDEAS
You can help add them by filling out this form.

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

When requesting a correction, please mention this item's handle: RePEc:mib:wpaper:347. 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: (Matteo Pelagatti)

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.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.