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.

We characterize the boundaries of the set of transfers (extremal transfers) implementing a given allocation rule without imposing any assumptions on the agentʼs type space or utility function besides quasi-linearity. Exploiting the concept of extremal transfers allows us to obtain an exact...

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

This paper studies pricing patterns in a speculative market with asymmetric information populated by both sophisticated and naive traders. Three pricing regimes arise in equilibrium: perfect pricing, with prices equalling asset values, partial mispricing and complete mispricing. Perfect pricing...

We study mechanism design problems in quasi-linear environments where the envelope theorem and revenue equivalence principle fail due to non-convex and non-differentiable valuations. We obtain a characterization of incentive compatibility based on the Mirrlees representation of the indirect...

This paper studies asymmetric first-price menu auctions in the procurement environment where the buyer does not commit to a decision rule and asymmetric sellers have interdependent costs and statistically affiliated signals. Sellers compete in bidding a menu of contracts, where a contract...

We introduce the concept of disjoint payoff matching which can be used to show that the mixed extension of a compact game is payoff secure. By putting minor structure on the discontinuities, we need only check payoffs at each strategy rather than in neighborhoods of each strategy profile,...