Jump to main content
Back to main page

Cutting a Cake for Infinitely Many Guests – Publication by Zsuzsanna Jankó

2022-09-02 14:13:01

The article co-authored by Zsuzsanna Jankó was published in the Electronic Journal of Combinatorics.

Kapcsolódó hírek

Kapcsolódó események

Corvinus Épület

Fair division with unequal shares is an intensively studied resource allocation problem. For  i∈[n]i∈[n], let μiμi be an atomless probability measure on the measurable space (C,S)(C,S) and let titi be positive numbers (entitlements) with ∑ni=1ti=1∑i=1nti=1. A fair division is a partition of CC into sets Si∈SSi∈S with μi(Si)≥tiμi(Si)≥ti for every i∈[n]i∈[n].  

We introduce new algorithms to solve the fair division problem with irrational entitlements. They are based on the classical Last diminisher technique and we believe that they are simpler than the known methods. Then we show that a fair division always exists even for infinitely many players. 

Dr. Jankó Zsuzsanna zsuzsanna.janko@uni-corvinus.hu Rektori Szervezet / Operáció és Döntés Intézet / Operációkutatás és Aktuáriustudományok Tanszék
Egyetemi Docens / Associate Professor
E épület, 120/a
Copied to clipboard
X
×
GEN.:2024.05.25. - 02:39:27