We examine auction design in a context where symmetrically informed adaptive agents with common valuations learn to bid for a good. Despite the absence of private valuations, asymmetric information, or risk aversion, bidder strategies do not converge to the Bertrand–Nash equilibrium strategies...

We introduce a computer program which calculates an agentʼs optimal behavior according to case-based decision theory (Gilboa and Schmeidler, 1995) and use it to test CBDT against a benchmark set of problems from the psychological literature on human classification learning (Shepard et al.,...

This paper studies the optimal design of delegation rule in a three-tier principal–intermediary–agent hierarchy. In this hierarchy, monetary transfer is not feasible, delegation is made sequentially, and all players are strategic. We characterize the optimal delegation mechanism. It is shown...

We consider a pairwise kidney exchange model. Roth et al. (2005) define priority matchings of the model and introduce a mechanism to derive them. In this paper, we re-examine the priority matching. First, we consider a general priority ordering where multiple patients may hold equal priority. We...

Minority games are a stylized description of strategic situations with both coordination and competition. These games are widely studied using either simulations or laboratory experiments. Simulations can show the dynamics of aggregate behavior, but the results of such simulations depend on the...

We consider a market for indivisible items with m buyers and m sellers. Traders privately know their values/costs, which are statistically dependent. Two mechanisms are considered. The buyer's bid double auction collects bids and asks from traders and determines the allocation by selecting a...

The standard method for computing the equilibrium strategies of asymmetric first-price auctions is the backward-shooting method. In this study we show that the backward-shooting method is inherently unstable, and that this instability cannot be eliminated by changing the numerical methodology of...

A minimal requirement on allocative efficiency in the social sciences is Pareto optimality. In this paper, we identify a close structural connection between Pareto optimality and perfection that has various algorithmic consequences for coalition formation. Based on this insight, we formulate the...

A decision maker (DM) considers the acquisition of a multi-attribute object with uncertain qualities which can be discovered at a cost. DM's problem is to decide how much to invest in the discovery and whether to adopt or discard based on partial information. We characterize the solution in some...

We show that in multi-sender communication games where senders imperfectly observe the state, if the state space is large enough, then there can exist equilibria arbitrarily close to full revelation of the state as the noise in the senders' observations gets small. In the case of replacement...