This paper presents a new iterative procedure for solving finite noncooperative games, the reasoning-based expected utility procedure (RBEU), and compares this with existing iterative procedures. RBEU deletes more strategies than iterated deletion of strictly dominated strategies, while avoiding the conceptual problems associated with iterated deletion of weakly dominated strategies. It uses a sequence of “accumulation” and “deletion” operations to categorise strategies as permissible and impermissible; strategies may remain uncategorised when the procedure halts. RBEU and related “categorisation procedures” can be interpreted as tracking successive steps in players’ own reasoning.
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.
Publisher Info
Paper provided by The Centre for Decision Research and Experimental Economics, School of Economics, University of Nottingham in its series Discussion Papers with number
2009-16.
For technical questions regarding this item, or to correct its listing, contact: (Alex Possajennikov).
Related research
Keywords:
Find related papers by JEL classification: C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
This paper has been announced in the following NEP Reports: