We consider the priority-based allocation problem: there is a set of indivisible objects with multiple supplies (e.g., schools with seats) and a set of agents (e.g., students) with priorities over objects (e.g., proximity of residence area). We study two well-known and competing mechanisms. The agentoptimal stable mechanism (AOSM) allots objects via the deferred acceptance algorithm. The top tr...

A Common Interest game is a game in which there exists a unique vector of payoffs which strictly Pareto-dominates all other payoffs. We consider the undiscounted repeated game obtained by the infinite repetition of such an n-player Common Interest game. We restrict supergame strategies to be computable within Church's thesis, and we introduce computable trembles on these strategies. If the trem...

We study the problem of providing two public goods on tree networks, in which each agent has a single-peaked preference. We show that if the number of agents is at least four, then there exists no social choice rule that satisfies efficiency and replacement– domination. In fact, it is shown that these two properties are incompatible even if agents’ preferences are restricted to a smaller domain...

This paper suggests a theory of choice among strategic situations when the rules of play are not properly specified. We take the view that a “strategic situation” is adequately described by a TU game since it specifies what is feasible for each coalition but is silent on the procedures that are used to allocate the surplus. We model the choice problem facing a decision maker (DM) as having to c...

In a market with stochastic demand at most one seller can acquire costly information about demand. Other sellers entertain idiosyncratic beliefs about the market demand and the probability that an informed seller is trading in the market. These idiosyncratic beliefs co-evolve with the potential insider’s inclination to acquire information. True demand expectations are not evolutionarily stable ...

We discuss four solution concepts for games with incomplete information. We show how each solution concept can be viewed as encoding informational robustness. For a given type space, we consider expansions of the type space that provide players with additional signals. We distinguish between expansions along two dimensions. First, the signals can either convey payoff relevant information or onl...

Many school districts in the US employ centralized clearing houses for the placement of students to public schools. A popular mechanism from two-sided matching theory, the Gale-Shapley studentoptimal stable mechanism, has recently replaced two de…cient mechanisms that were in use in NYC and Boston. An important potential threat against any school choice mechanism is the tendency of schools to c...

We study the problem of allocating heterogeneous indivisible tasks in a multi-object-demand model (i.e., each agent can be assigned multiple objects) where monetary transfers are allowed. Agents’ costs for performing tasks are their private information and depend on what other tasks they are obtained with. First, we show that when costs are unrestricted or superadditive, then there is no envy-f...

In consecutive rounds, each agent in a finite population chooses an action, is randomly matched, obtains a payoff and then observes the performance of another agent. An agent determines future behavior based on the information she receives from the present round. She chooses among the behavioral rules that increase expected payoffs in any specifications of the matching scenario. The rule that o...

We consider the role of the common prior for robust implementation in an environment with interdependent values. Specifically, we investigate a model of public good provision which allows for negative and positive informational externalities. In the corresponding direct mechanism, the agents’ reporting strategies are strategic complements with negative informational externalities and strategic ...