9 papers
Exact Cut Complexity of Equal-Length Proportional Cake Cutting
Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui
We study proportional cake cutting under an equal-length constraint, where each of agents must receive a bundle of length exactly that is worth at least to that age…
The regular inverse Galois problem over fields avoiding a curve
Jinhe Ye
Let be a field of characteristic , and let be a smooth geometrically integral curve of positive genus with . We prove that the regular inverse…
Simultaneously Efficient Allocation of Indivisible Items Across Multiple Dimensions
Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui
Many allocation problems are intrinsically multidimensional, since an item may contribute differently to several criteria, and optimizing a single aggregate objective can hide seve…
Simultaneously Fair Allocation of Indivisible Items Across Multiple Dimensions
Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui
This paper explores the fair allocation of indivisible items in a multidimensional setting, motivated by the need to address fairness in complex environments where agents assess bu…
Resource Allocation under the Latin Square Constraint
Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui
A Latin square is an matrix filled with distinct symbols, each of which appears exactly once in each row and exactly once in each column. We introduce a problem of…
Contiguous Allocation of Indivisible Items on a Path
Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui
We study the problem of allocating indivisible items on a path among agents. The objective is to find a fair and efficient allocation in which each agent's bundle forms a contiguou…
Externalities in Chore Division
Mohammad Azharuddin Sanpui
The chore division problem simulates the fair division of a heterogeneous, undesirable resource among several agents. In the fair division of chores, each agent only gets the disut…
Chore Cutting: Envy and Truth
Mohammad Azharuddin Sanpui
We study the fair division of divisible bad resources with strategic agents who can manipulate their private information to get a better allocation. Within certain constraints, we…
Fair Division of Multi-layered Cakes
Mohammad Azharuddin Sanpui
We consider multi-layered cake cutting in order to fairly allocate numerous divisible resources (layers of cake) among a group of agents under two constraints: contiguity and feasi…