We characterize revenue maximizing mechanisms in a common value environment where the value of the object is equal to the highest of bidders’ independent signals. If the object is optimally sold with probability one, then the optimal mechanism is simply a posted price, with the highest...

In a general interdependent preference environment, we characterize when two payoff types can be distinguished by their rationalizable strategic choices without any prior knowledge of their beliefs and higher order beliefs. We show that two payoff types are strategically distinguishable if and...

A game of incomplete information can be decomposed into a basic game and an information structure. The basic game defines the set of actions, the set of payoff states the payoff functions and the common prior over the payoff states. The information structure refers to the signals that the...

Jackson and Watts [J. of Econ. Theory 71 (2002), 44-74] have examined the dynamic formation and stochastic evolution of networks. We provide a refinement of pairwise stability, p-pairwise stability, which allows us to characterize the stochastically stable networks without requiring the tree...

We study Pareto efficient mechanisms in matching markets when the number of agents is large and individual preferences are randomly drawn from a class of distributions, allowing for both common and idiosyncratic shocks. We provide a broad set of circumstances under which, as the market grows...

We generalize the canonical problem of Nash implementation by allowing agents to voluntarily provide discriminatory signals, i.e. evidence. Evidence can either take the form of hard information or, more generally, have differential but non-prohibitive costs in different states. In such...

We consider a model of evolution in games in which a revising agent observes the actions of a random number of randomly sampled opponents and then chooses a best response to the distribution of actions in the sample. We provide a condition on the distribution of sample sizes under which an...

In a strategic game, a curb set [Basu and Weibull, Econ. Letters 36 (1991) 141] is a product set of pure strategies containing all best responses ro every possible belief restricted to this set. Prep sets [Voorneveld, Games Econ. Behav. 48 (2004) 403] relax this condition by only requiring the...

We show that local potential maximizer ([15]) 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 our main...

We study a large market model of dynamic matching with no monetary transfers and a continuum of agents who have to be assigned items at each date. When the social planner can only elicit ordinal agents' preferences, we prove that under a mild regularity assumption, incentive compatible and...