• Medientyp: E-Book
  • Titel: 3 Persons, 2 Cuts : A Maximin Envy-Free and a Maximally Equitable Cake-Cutting Algorithm
  • Beteiligte: Brams, Steven J. [VerfasserIn]; Landweber, Peter S. [Sonstige Person, Familie und Körperschaft]
  • Erschienen: [S.l.]: SSRN, [2018]
  • Umfang: 1 Online-Ressource (21 p)
  • Sprache: Englisch
  • DOI: 10.2139/ssrn.3126935
  • Identifikator:
  • Entstehung:
  • Anmerkungen: Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments February 2018 erstellt
  • Beschreibung: We describe a 3-person, 2-cut envy-free cake-cutting algorithm, inspired by a continuous moving-knife procedure, that does not require that the players continuously move knifes across the cake. By having the players submit their value functions over the cake to a referee—rather than move knives according to these functions—the referee can ensure that the division is not only envy-free but also maximin. In addition, the referee can use the value functions to find a maximally equitable division, whereby the players receive equally valued shares that are maximal, but this allocation may not be envy-free
  • Zugangsstatus: Freier Zugang