Dynamic game theory is applied to analyze the timber market in northern Iran as a duopsony. The Nash equilibrium and the dynamic properties of the system based on marginal adjustments are determined. When timber is sold, the different mills use mixed strategies to give sealed bids. It is found...

Sufficient conditions for Nash equilibrium in an n-person game are given in terms of what the players know and believe — about the game, and about each other's rationality, actions, knowledge, and beliefs. Mixed strategies are treated not as conscious randomizations, but as conjectures, on the...

AbstractWe exhibit a large class of simple rules of behavior, which we call adaptive heuristics, and show that they generate rational behavior in the long run. These adaptive heuristics are based on natural regret measures, and may be viewed as a bridge between rational and behavioral...

AbstractHart and Mas-Colell (2000) show that if all players play “regret matching” strategies, i.e., they play with probabilities proportional to the regrets, then the empirical distribution of play converges to the set of correlated equilibria, and the regrets of every player converge to...

Suppose that each player in a game is rational, each player thinks the other players are rational, and so on. Also, suppose that rationality is taken to incorporate an admissibility requirement — that is, the avoidance of weakly dominated strategies. Which strategies can be played? We provide...

Game-theoretic analysis often leads to consideration of an infinite hierarchy of beliefs for each player. Harsanyi suggested that such a hierarchy of beliefs could be summarized in a single entity, called the player's type. This chapter provides an elementary construction, complementary to the...

AbstractWe study the question of how long it takes players to reach a Nash equilibrium in uncoupled setups, where each player initially knows only his own payoff function. We derive lower bounds on the communication complexity of reaching a Nash equilibrium, i.e., on the number of bits that need...

Best-response sets (Pearce [1984]) characterize the epistemic condition of “rationality and common belief of rationality.” When rationality incorporates a weak-dominance (admissibility) requirement, the self-admissible set (SAS) concept (Brandenburger, Friedenberg, and Keisler [2008])...

Two properties of preferences and representations for choice under uncertainty which play an important role in decision theory are: (i) admissibility, the requirement that weakly dominated actions should not be chosen; and (ii) the existence of well defined conditional probabilities, that is,...