A collective decision problem is described by a set of agents, a profile of single-peaked preferences over the real line and a number of public facilities to be located. We consider public facilities that do not suffer from congestion and are non-excludable. We characterize the class of rules...

We study desirability axioms imposed on allocations in indivisible object allocation problems. The existing axioms in the literature are various conditions of robustness to blocking coalitions with respect to agentsʼ ex ante (individual rationality and group rationality) and ex post (Pareto...

We study many-to-one matching markets where hospitals have responsive preferences over students. We study the game induced by the student-optimal stable matching mechanism. We assume that students play their weakly dominant strategy of truth-telling.

Recently, Hermandez-Lamoneda et al. (2008) and independently Chameni and Andjiga (2008) gave an analytic formulation for all valued solutions to the n-person TU-games that satisfy linearity, efficiency and symmetry axioms. Our main purpose in this paper is to recast the proposed formulation to a...

We describe and characterize the family of asymmetric parametric division rules for the adjudication of conflicting claims on a divisible homogeneous good. As part of the characterization, we present two novel axioms which restrict how a division rule indirectly allocates between different...

We analyze the problem of aggregating judgments over multiple issues from the perspective of whether aggregate judgments manage to efficiently use all voters' private information. While new in judgment aggregation theory, this perspective is familiar in a different body of literature about...

We consider the Hotelling–Downs model with n⩾3 office-seeking candidates and runoff voting. We show that Nash equilibria in pure strategies always exist and that there are typically multiple equilibria, both convergent (all candidates are located at the median) and divergent (candidates...

We consider dynamic group formation in repeated n-person prisonerʼs dilemma. Agreements in coalitional bargaining are self-binding in that they are supported as subgame perfect equilibria of repeated games. Individuals are allowed to renegotiate the cooperating group agreement through a process...

We consider the “airport problem”, which is concerned with sharing the cost of an airstrip among agents who need airstrips of different lengths. We investigate the implications of two properties, Left-endpoint Subtraction (LS) bilateral consistency and LS converse consistency, in the airport...

We extend the result from Bossert and Sprumont (2013) that every single-valued choice function is backwards-induction rationalizable via strict preferences to the case of choice correspondences via weak preferences.