This paper shows that the possibility of collusion between an agent and a supervisor imposes no restrictions on the set of implementable social choice functions (SCF) and associated payoff vectors. Any SCF and any payoff profile that are implementable if the supervisor's information was public...

We study centralized many-to-many matching in markets where agents have private information about (vertical) characteristics that determine match values. Our analysis reveals how matching patterns reflect cross-subsidization between sides. Agents are endogenously partitioned into consumers and...

As European countries move towards complete unbundling in electricity markets, some issues regarding market design are still under discussion. In particular, which market configuration would give the right incentives to promote efficiency and reduce final prices. In this paper we analyze a...

Different evaluators typically disagree how to rank different candidates since they care more or less for the various qualities of the candidates. It is assumed that all evaluators submit vector bids assigning a monetary bid for each possible rank order. The rules must specify for all possible...

This paper introduces a mechanism design approach that allows dealing with the multiple equilibrium problem, using mechanisms that are robust to bounded rationality. This approach is a tool for constructing supermodular mechanisms, i.e. mechanisms that induce games with strategic...

This paper considers mechanism design problems in environments with ambiguity-sensitive individuals. The novel idea of the paper is to introduce ambiguity in mechanisms so as to exploit the ambiguity sensitivity of individuals. We prove a revelation principle for the partial implementation of...

Rating systems not only provide information to users but also motivate the rated agent. This paper solves for the optimal (effort-maximizing) rating system within the standard career concerns framework. It is a mixture two-state rating system. That is, it is the sum of two Markov processes, with...

We examine a non-cooperative queueing game where a finite number of customers seek service at a bottleneck facility which opens at a given point in time. The facility servers one customer at a time on a first-come, first-serve basis and the amount of time required to service each customer is...

Complementary to the axiomatic and mechanism design studies on queueing problems, this paper proposes a strategic bargaining approach to resolve queueing conflicts. Given a situation where players with different waiting costs have to form a queue in order to be served, they firstly compete with...

We analyze the social and private learning at the symmetric equilibria of a queueing game with strategic experimentation. An infinite sequence of agents arrive at a server which processes them at an unknown rate. The number of agents served at each date is either: a geometric random variable in...