In this paper, we examine the optimal mechanism design of selling an indivisible object to one regular buyer and one publicly known buyer, where inter-buyer resale cannot be prohibited. The resale market is modeled as a stochastic ultimatum bargaining game between the two buyers. We fully...

We study mechanism design in non-Bayesian settings of incomplete information, when the designer has no information about the players, and the players have arbitrary, heterogeneous, first-order, and possibilistic beliefs about their opponents' payoff types.

A repeated game with private monitoring is “close” to a repeated game with public monitoring (or perfect monitoring) when (i) the expected payoff structures are close and (ii) the informational structures are close in the sense that private signals in the private monitoring game can be...

This paper studies long term relationships, modeled as repeated games, with restricted feedback. Players condition current play on summary statistics of past play rather than the entire history, as may be the case in online markets. Our state strategy equilibrium framework allows for arbitrary...

We analyze an equilibrium concept called revision-proofness for infinite-horizon games played by a dynasty of players. Revision-proofness requires strategies to be robust to joint deviations by multiple players and is a refinement of sub-game perfection. Sub-game perfect paths that can only be...

We study symmetric play in a class of repeated games when players are patient. We show that, while the use of symmetric strategy profiles essentially does not restrict the set of feasible payoffs, the set of equilibrium payoffs is an interesting proper subset of the feasible and individually...

We consider a dynamic version of sender–receiver games, where the sequence of states follows an irreducible Markov chain observed by the sender. Under mild assumptions, we provide a simple characterization of the limit set of equilibrium payoffs, as players become very patient. Under these...

We establish reputation results, under two sided incomplete information, for a class of repeated games. We consider a repeated game that satisfies the assumptions of either Atakan and Ekmekci (2012) [3] or Cripps et al. (2005) [6] and we assume that both players are Stackelberg types with...

This note extends Wiseman [6] to more general reputation games with exogenous learning. Using Gossner's [4] relative entropy method, we provide an explicit lower bound on all Nash equilibrium payoffs of the long-lived player. The lower bound shows that when the exogenous signals are sufficiently...

We study an infinitely repeated game where two players with equal discount factors play a simultaneous-move stage game. Player one monitors the stage-game actions of player two imperfectly, while player two monitors the pure stage-game actions of player one perfectly. Player one's type is...