Mechanisms for division problems with single-dipped preferences

Research output: Working paper / PreprintWorking paper

113 Downloads (Pure)


A mechanism allocates one unit of an infinitely divisible commodity among agents reporting a number between zero and one. Nash, Pareto optimal Nash, and strong equilibria are analyzed for the case where the agents have single-dipped preferences. One of the main results is that when the mechanism is anonymous, monotonic, standard, and order preserving, then the Pareto optimal Nash and strong equilibria coincide and assign Pareto optimal allocations that are characterized by so-called maximal coalitions: members of a maximal coalition prefer an equal coalition share over obtaining zero, whereas the outside agents prefer zero over obtaining an equal share from joining the coalition.
Original languageEnglish
PublisherMaastricht University, Graduate School of Business and Economics
Number of pages25
Publication statusPublished - 18 Jul 2022

Publication series

SeriesGSBE Research Memoranda

JEL classifications

  • c72 - Noncooperative Games
  • d71 - "Social Choice; Clubs; Committees; Associations"


  • division problems
  • single-dipped preferences
  • mechanisms
  • Nash equilibrium
  • strong equilibrium


Dive into the research topics of 'Mechanisms for division problems with single-dipped preferences'. Together they form a unique fingerprint.

Cite this