Koji Takamiya () (Graduate School of Economics and Business Administration, Hokkaido University, Kita9 Nishi7 Sapporo 060-0809 Japan)
Abstract
This paper examines the -core of strategic games by means of the consistency principle. I provide a new definition of a reduced game for strategic games. And I define consistency (CONS) and two forms of converse consistency (COCONS and COCONS*) under this definition of reduced games. Then I axiomatize the -core for families of strategic games with bounded payoff functions by the axioms CONS, COCONS*, weak Pareto optimality (WPO) and one person rationality (OPR). Furthermore, I show that these four axioms are logically independent. In proving this, I also axiomatize the -individually rational solution by CONS, COCONS and OPR for the same families of games. Here the -individually rational solution is a natural extension of the classical `maximin' solution.
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.
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.
Find related papers by JEL classification: C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games