?
Several Stories about High-Multiplicity EFx Allocation (Student Abstract)
.
Morozov N., Ignatiev A., Dementiev Yuriy
Keywords: fair division
Publication based on the results of:
In book
Vol. 38. Issue 21. , Washington: AAAI Press, 2024.
M. L. Blank, Polyakov M. O., Problems of Information Transmission 2024 Vol. 60 No. 1 P. 53–70
A new and relatively elementary approach is proposed for solving
the problem of fair division of a continuous resource (measurable space,
pie, etc.) between several participants, the selection criteria
of which are described by charges (signed measures).
The setting of the problem with charges is considered for
the first time. The problem comes down to analyzing the properties
of the trajectories ...
Added: January 16, 2025
Bogomolnaia A., Moulin H., Sandomirskiy F., Management Science 2022 Vol. 68 No. 2 P. 1174–1194
Ann likes oranges much more than apples; Bob likes apples much more than oranges. Tomorrow they will receive one fruit that will be an orange or an apple with equal probability. Giving one half to each agent is fair for each realization of the fruit. However, agreeing that whatever fruit appears will go to the ...
Added: September 7, 2021
Moulin H., Bogomolnaia A., / Series Theoretical Economics "arxiv.org". 2020.
To divide a "manna" {\Omega} of private items (commodities, workloads, land, time intervals) between n agents, the worst case measure of fairness is the welfare guaranteed to each agent, irrespective of others' preferences. If the manna is non atomic and utilities are continuous (not necessarily monotone or convex), we can guarantee the minMax utility: that ...
Added: October 29, 2020
Sandomirskiy F., Segal-Halevi E., / Series arXiv "Computer Science and Game Theory (cs.GT), arXiv:1908.01669". 2019.
A set of objects, some goods and some bads, is to be divided fairly among agents with different tastes, modeled by additive utility-functions. If the objects cannot be shared, so that each of them must be entirely allocated to a single agent, then fair division may not exist. What is the smallest number of objects ...
Added: September 24, 2019
Branzei S., Sandomirskiy F., / Series arxiv "Computer Science and Game Theory (cs.GT), arXiv:1907.01766". 2019.
We study the problem of allocating divisible bads (chores) among multiple agents with additive utilities, when money transfers are not allowed. The competitive rule is known to be the best mechanism for goods with additive utilities and was recently extended to chores by Bogomolnaia et al (2017). For both goods and chores, the rule produces ...
Added: September 24, 2019