✦ LIBER ✦

Approximating fair division with a limited number of cuts

✍ Scribed by Jack M Robertson; William A Webb

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 265 KB
Volume: 72
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(95)90073-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Approximation Scheme For Cake Divisio

An Approximation Scheme For Cake Division With A Linear Number Of Cuts

✍ Jiří Sgall*; Gerhard J. Woeginger 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 154 KB

How to cut a pizza fairly: Fair division

How to cut a pizza fairly: Fair division with decreasing marginal evaluations

✍ Fabio Maccheroni; Fabio Maccheroni; Massimo Marinacci; Massimo Marinacci 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 221 KB

Determining minimal cuts with a minimal

Determining minimal cuts with a minimal number of arcs

✍ Horst Hamacher 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 478 KB

Preference revelation with a limited num

Preference revelation with a limited number of indifference classes

✍ Donald E.Campbell; Jerry S. Kelly 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 78 KB

Constructing fair round robin tournament

Constructing fair round robin tournaments with a minimum number of breaks

✍ Pim van ’t Hof; Gerhard Post; Dirk Briskorn 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Given n clubs with two teams each, we show that, if n is even, it is possible to construct a schedule for a single round robin tournament satisfying the following properties: the number of breaks is 2n -2, teams of the same club never play at home simultaneously, and they play against each other in

The electrochemical behavior of a system

The electrochemical behavior of a system with a limited number of molecules

✍ Shuai Liang; Xiandui Dong 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 215 KB