We study an online version of the max-min fair allocation problem for indivisible items. In this
problem, items arrive one by one, and each item must be allocated irrevocably on arrival to …

We consider the problem of random assignment of indivisible goods, in which each agent
has an ordinal preference and a constraint. Our goal is to characterize the conditions under …

Leximin is a common approach to multi-objective optimization, frequently employed in fair
division applications. In leximin optimization, one first aims to maximize the smallest …

Distributed resource allocation arises in many application domains such as smart cities,
intelligent transportation systems, sharing economy, cloud computing, edge-computing …

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 …

Two prominent objectives in social choice are utilitarian-maximizing the sum of agents'
utilities, and leximin-maximizing the smallest agent's utility, then the second-smallest, etc …

We study a dynamic allocation problem in which $ T $ sequentially arriving divisible
resources are to be allocated to a number of agents with linear utilities. The marginal utilities …

In this paper, we study the following robust optimization problem. Given a set family
representing feasibility and candidate objective functions, we choose a feasible set, and …

A lottery is a popular form of gambling between a seller and multiple buyers, and its
profitable design is of primary interest to the seller. Designing a lottery requires modeling the …