A set of agents with different waiting costs have to receive a service of equal length of time from a single provider which can serve only one agent at a time. One needs to form a queue and set up monetary transfers to compensate the agents who have to wait. We analyze rules that are efficient, fair, and immune to strategic behavior. We prove that no rule is Pareto-efficient and coalitional str...

In multilateral enforcement, a player who cheats on one partner is punished by many partners. But renegotiation might subvert the threat of multilateral punishment. We consider renegotiation proofness in multilateral enforcement games with public monitoring, and also introduce the notion of “bilateral renegotiation proofness” for games with private monitoring. With public monitoring, renegotiat...

In this paper, we consider a relationship between equity and efficiency in queueing problems. We show that under strategy-proofness, anonymity in welfare implies queue-efficiency. Furthermore, we also give a characterization of the equally distributed pairwise pivotal rule, as the only rule that satisfies strategy-proofness, anonymity in welfare and budget-balance. keywords: Queueing Problems, ...

Wedefine different concepts of group strategy-proofness for social choice functions. We discuss the connections between the defined concepts under different assumptions on their domains of definition. We characterize the social choice functions that satisfy each one of them and whose ranges consist of two alternatives, in terms of two types of basic properties. Finally, we obtain the functional...

Random mechanisms have been used in real-life situations for reasons such as fairness. Voting and matching are two examples of such situations. We investigate whether desirable properties of a random mechanism survive decomposition of the mechanism as a lottery over deterministic mechanisms that also hold such properties. To this end, we represent properties of mechanisms—such as ordinal strate...

The class of Groves mechanisms has been attracting much attention in mechanism design literature due to two attractive characteristics: utilitarian efficiency (also called social welfare maximization) and dominant strategy incentive compatibility. However, when strategic agents can create multiple fake identities and reveal more than one preference under them, a refined characteristic called fa...

Matching a set of agents to a set of objects has many real applications. One well-studied framework is that of prioritybased matching, in which each object is assumed to have a priority order over the agents. The Deferred Acceptance (DA) and Top-Trading-Cycle (TTC) mechanisms are the best-known strategy-proof mechanisms. However, in highly anonymous environments, the set of agents is not known ...

We study a general aggregation problem in which a society has to determine its position on each of several issues, based on the positions of the members of the society on those issues. There is a prescribed set of feasible evaluations, i.e., permissible combinations of positions on the issues. Among other things, this framework admits the modeling of preference aggregation, judgment aggregation...