We consider the problem of guaranteeing a fraction of the maximin-share ...
We study fair division of indivisible chores among n agents with additiv...
We consider the problem of maximizing the Nash social welfare when alloc...
Patience Sort sorts a sequence of numbers with a minimal number of queue...
The existence of EFX allocations is a fundamental open problem in discre...
We consider the problem of maximizing the Nash social welfare when alloc...
We study the problem of allocating a set of indivisible goods among agen...
We study the problem of fairly allocating a set of indivisible goods amo...
In wet-lab experiments, the slime mold Physarum polycephalum has demonst...
Let L be a set of n lines in the plane, not necessarily in general
posit...
We study the problem of allocating a set of indivisible items among agen...
Fair division of indivisible goods is a very well-studied problem. The g...
The goal of the LEDA project was to build an easy-to-use and extendable
...
The directed Physarum dynamics is known to solve positive linear program...
When a loan is approved for a person or company, the bank is subject to
...
Let c ∈Z^m_> 0, A ∈Z^n× m, and b ∈Z^n. We show under fairly general cond...
We study the query complexity of a permutation-based variant of the gues...
We present a combinatorial algorithm for determining the market clearing...
We study multi-finger binary search trees (BSTs), a far-reaching extensi...
The papers hatfimmokomi11 and azizbrilharr13 propose algorithms
for test...
We consider the task of assigning indivisible goods to a set of agents i...