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…
Stable and Fair Random Allocations in a Two-Sided Discrete-Concave Market
Kenzo Imamura, Yasushi Kawase
We study random allocations in two-sided many-to-many matching markets with ties, where random tie-breaking can violate ex ante stability and fairness. We show that, when valuation…
Fair and Efficient Balanced Allocation for Indivisible Goods
Yasushi Kawase, Ryoga Mahara
We study the problem of allocating indivisible goods among agents with additive valuation functions to achieve both fairness and efficiency under the constraint that each agent rec…
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…
Online Matching with Delays and Size-based Costs
Yasushi Kawase, Tomohiro Nakayoshi
In this paper, we introduce the problem of Online Matching with Delays and Size-based Costs (OMDSC). The OMDSC problem involves requests arriving online. At any time, a group c…
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…