One way to express bounded rationality of a player in a game theoretic models is by specifying a set of feasible strategies for that player. In dynamic game models with finite automata and bounded recall strategies, for example, feasibility of strategies is determined via certain complexity...

We study two-person repeated games in which a player with a restricted set of strategies plays against an unrestricted player. An exogenously given bound on the complexity of strategies, which is measured by the size of the smallest automata that implement them, gives rise to a restriction on...

n overview of the landmark contributions of Robert J. Aumann, winner of the 2005 Nobel Memorial Prize in Economic Sciences.

We analyse a common value, alternating ascending bid, first price auction as a repeated game of incomplete information where the bidders hold equal property rights to the object auctioned off. Consequently they can accept (by quitting) or veto any proposed settlement. We characterise the...