We consider a game G(n) played by two players. There are n independent random variables Z(1),...,Z(n), each of which is uniformly distributed on [0,1]. Both players know n, the independence and the distribution of these random variables, but only player 1 knows the vector of realizations z :=...

This paper is concerned with a combinatorial, multi-attribute procurement mechanism called combinatorial scoring auction. In the setting that we analyze, private information of the suppliers is multi-dimensional. The buyer wants to procure several items at once. Subsets of these items are...

The Rubinstein alternating offers bargaining game is reconsidered under the assumption that each player is loss averse and the associated reference point is equal to the highest turned down offer of the opponent in the past. This makes the payoffs and therefore potential equilibrium strategies...

In this paper we present a model for games with perfect information in which the players, upon observing an unexpected move, may revise their beliefs about the opponents'' preferences over outcomes. For a given profile P of preference relations over outcomes, we impose the following three...

Within a formal epistemic model for simultaneous-move games, we present the following conditions: (1) belief in the opponents'' rationality (BOR), stating that a player should believe that every opponent chooses an optimal strategy, (2) self-referential beliefs (SRB), stating that a player...

In this survey we analyze, and compare, various sufficient epistemic conditions for backward induction that have been proposed in the literature. To this purpose we present a simple epistemic base model for games with perfect information, and translate the different models into the language of...

This paper presents a formal epistemic framework for dynamic games in which players, during the course of the game, may revise their beliefs about the opponents'' utility functions. We impose three key conditions upon the players'' beliefs: (a) throughout the game, every move by the opponent...

We consider discounted repeated games in which players can voluntarily purchase information about the opponents’ actions at past stages. Information about a stage can be bought at a fixed but arbitrary cost. Opponents cannot observe the information purchase by a player. For our main result, we...

In this paper we develop an epistemic model for dynamic games in which players may revise their beliefs about the opponents'' preferences (including the opponents'' utility functions) as the game proceeds. Within this framework, we propose a rationalizability concept that is based upon the...

We investigate the problem in which an agent has to find an object that moves between two locations according to a discrete Markov process (see Pollock, 1970). At every period, the agent has three options: searching left, searching right, and waiting. We assume that waiting is costless whereas...