Add to ORKGNash welfare maximization is widely studied because it balances efficiency and fairness in resource allocation problems. Banerjee, Gkatzelis, Gorokh, and Jin (2022) recently introduced the model of online Nash welfare maximization with predictions for $T$ divisible items and $N$ agents with additive utilities. They gave online algorithms whose competitive ratios are logarithmic. We initiate the study of online Nash welfare maximization \emph{without predictions}, assuming either that the agents' utilities for receiving all items differ by a bounded ratio, or that their utilities for the Nash welfare maximizing allocation differ by a bounded ratio. We design online algorithms whose competitive ratios only depend on the logarithms of the afor...
We consider the problem of dividing limited resources to individuals arriving over $T$ rounds. Each ...
We consider the task of assigning indivisible goods to a set of agents in a fair manner. Our notion ...
We consider the problem of fairly allocating a set of indivisible goods to a set of strategic agents...
This work addresses learning online fair division under uncertainty, where a central planner sequent...
Online allocation is a broad class of problems where items arriving online have to be allocated to a...
We study different aspects of the multiagent resource allocation problem when the objective is to fi...
We design online algorithms for the fair allocation of public goods to a set of $N$ agents over a se...
We consider the problem of maximizing the Nash social welfare when allocatinga set $\mathcal{G}$ of ...
We allocate objects to agents as exemplified primarily by school choice. Welfare judgments of the ob...
Resource allocation aims at allocating scarce resources to strategic agents in an efficient and fair...
We consider the problem of maximizing the Nash social welfare when allocatinga set $G$ of indivisibl...
We study the problem of allocating indivisible goods among $n$ agents with the objective of maximizi...
It is often beneficial for agents to pool their resources in order to better accommodate fluctuation...
For any $\varepsilon>0$, we give a simple, deterministic $(6+\varepsilon)$-approximation algorithm f...
In load balancing problems there is a set of clients, each wishing to select a resource from a set o...
We consider the problem of dividing limited resources to individuals arriving over $T$ rounds. Each ...
We consider the task of assigning indivisible goods to a set of agents in a fair manner. Our notion ...
We consider the problem of fairly allocating a set of indivisible goods to a set of strategic agents...
This work addresses learning online fair division under uncertainty, where a central planner sequent...
Online allocation is a broad class of problems where items arriving online have to be allocated to a...
We study different aspects of the multiagent resource allocation problem when the objective is to fi...
We design online algorithms for the fair allocation of public goods to a set of $N$ agents over a se...
We consider the problem of maximizing the Nash social welfare when allocatinga set $\mathcal{G}$ of ...
We allocate objects to agents as exemplified primarily by school choice. Welfare judgments of the ob...
Resource allocation aims at allocating scarce resources to strategic agents in an efficient and fair...
We consider the problem of maximizing the Nash social welfare when allocatinga set $G$ of indivisibl...
We study the problem of allocating indivisible goods among $n$ agents with the objective of maximizi...
It is often beneficial for agents to pool their resources in order to better accommodate fluctuation...
For any $\varepsilon>0$, we give a simple, deterministic $(6+\varepsilon)$-approximation algorithm f...
In load balancing problems there is a set of clients, each wishing to select a resource from a set o...
We consider the problem of dividing limited resources to individuals arriving over $T$ rounds. Each ...
We consider the task of assigning indivisible goods to a set of agents in a fair manner. Our notion ...
We consider the problem of fairly allocating a set of indivisible goods to a set of strategic agents...