In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...

We analyze a repeated first-price auction in which the types of the players are determined before the first round. It is proved that if every player is using either a belief-based learning scheme with bounded recall or a generalized fictitious play learning scheme, then for sufficiently large...

In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...

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...

Unique-lowest sealed-bid auctions are auctions in which participation is endogenous and the winning bid is the lowest bid among all unique bids. Such auctions admit very many Nash equilibria (NEs) in pure and mixed strategies. The two-bidders' auction is similar to the Hawk-Dove game, which...

This paper presents a unified framework for characterizing symmetric equilibrium in simultaneous move, two-player, rank-order contests with complete information, in which each player's strategy generates direct or indirect affine spillover effects that depend on the rank-order of her decision...

Second price allpay auctions (wars of attritions) have an evolutionarily stable equilibrium in pure strategies if valuations are private information. I show that for any level of uncertainty there exists a pure deviation strategy close to the equilibrium strategy such that for some valuations...

Second price allpay auctions (wars of attritions) have an evolutionarily stable equilibrium in pure strategies if valuations are private information. I show that for any level of uncertainty there exists a pure deviation strategy close to the equilibrium strategy such that for some valuations...

This paper studies sequential auctions in the presence of Knightian uncertainty about the distribution of values. We propose equilibrium notions based on the multiple selves approach to deal with the possible time inconsistency that arises with dynamic bidding for max-min bidders. We...

We justify risk neutral equilibrium bidding in commonly known fair division games with incompleteinformation by an evolutionary setup postulating (i) minimal common knowledge, (ii) optimal responses to conjectural beliefs how others behave and (iii) evolutionary selection of conjectural beliefs...