We formulate the problem of fair and efficient completion of indivisible goods, defined as
follows: Given a partial allocation of indivisible goods among agents, does there exist an …

Fairness in Multi-Agent Systems (MAS) has been extensively studied, particularly in reward
distribution among agents in scenarios such as goods allocation, resource division, lotteries …

We study the problem of fairly allocating $ m $ indivisible goods to $ n $ agents, where
agents may have different preferences over the goods. In the traditional setting, agents' …

A Latin square is an $ n\times n $ matrix filled with $ n $ distinct symbols, each of which
appears exactly once in each row and exactly once in each column. We introduce a problem …

In fair division of indivisible items, domain restriction has played a key role in escaping from
negative results and providing structural insights into the computational and axiomatic …

Contiguous Allocation of Binary Valued Indivisible Items on a Path Page 1 Contiguous Allocation
of Binary Valued Indivisible Items on a Path Extended Abstract Yasushi Kawase ∗ The University …

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 contiguous block …

The distribution of resources is a critical issue that impacts all aspects of the Internet and
society, with fairness playing a key role. Current standard algorithms for distribution typically …