We consider a dynamic auction problem motivated by the traditional single-leg, multi-period revenue management problem. A seller with C units to sell faces potential buyers with unit demand who arrive and depart over the course of T time periods. The time at which a buyer arrives, her value for...

under the profile after two distinct histories that agree in the last L periods is equal. Mailath and Morris (2002, 2006) proved that any strict equilibrium in bounded-recall strategies of a game with full support public monitoring is robust to all perturbations of the monitoring structure...

We analyse finite two player games in which agents maximize given arbitrary private payoffs which we call ideologies. We define an equilibrium concept and prove existence. Based on this setup, a monotone evolutionary dynamic governs the distribution of ideologies within the population. For any...

Many conditions have been introduced to weaken the continuity re-quirements for equilibrium existence in games. We introduce a new con-dition, called regularity, that is simple and easy to verify. It is implied both by Reny's better-reply security and Simon and Zame's endogenous sharing rule...

We show that local potential maximizer (\cite{morris+05}) with constant weights is stochastically stable in the log-linear dynamics provided that the payoff function or the associated local potential function is supermodular. We illustrate and discuss, through a series of examples, the use of...

This paper presents a Schelling-type checkerboard model of residential segregation formulated as a spatial game. It shows that although every agent prefers to live in a mixed-race neighborhood, complete segregation is observed almost all of the time. A concept of tipping is rigorously defined,...

We consider the regret matching process with finite memory. For general games in normal form, it is shown that any recurrent class of the dynamics must be such that the action profiles that appear in it constitute a closed set under the “same or better reply” correspondence (CUSOBR set) that...

Imperfect private monitoring in an infinitely repeated discounted Prisoner's Dilemma played on a communication network is studied. Players observe their direct neighbors' behavior only, but communicate strategically the repeated game's history throughout the network. The delay in receiving this...

We study two n-player sequential network formation games with externalities. Link formation is tied to simultaneous transfer selection in a Nash demand like game in each period. Players in groups can counterpropose. We give necessary and sufficient conditions for efficiency in terms of cyclical...

We introduce a stochastic game in which transition probabilities depend on the history of the play, i.e., the players' past action choices. To solve this new type of game under the limiting average reward criterion, we determine the set of jointly-convergent pure-strategy rewards which can be...