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
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.
We use cookies on the Corvinus website in order to properly operate, improve and monitor the website’s activities, collect statistics and improve the user experience. By using this site, you consent to the use of cookies.
In order to continuously improve and personalize the services you use, we record the activity of visitors on our website for analysis purposes. This data helps us understand how our visitors use our site, which features are most popular, and how we can enhance user experience. Additionally, this data collection allows us to conduct more effective targeted marketing activities, thereby offering content and promotions that match your interests.
The legal basis for processing your data is your consent, which is given by using our website. Further information is detailed in our privacy policy, where you can learn about our data handling practices, the duration of data storage, and your rights and how to exercise them.
