We consider the problem of allocating a set of divisible goods to $N$ agents in an online manner, aiming to maximize the Nash social welfare, a widely studied objective which provides a balance between fairness and efficiency. The goods arrive in a …
We consider the problem of dividing limited resources to individuals arriving over $T$ rounds. Each round has a random number of individuals arrive, and individuals can be characterized by their type (i.e. preferences over the different resources). A …
In many settings, resources are allocated among agents repeatedly over time without the use of monetary transfers: consider, for example, allocating server-time to company employees, rooms to students, or food among food banks. Here, the central …
Non-monetary mechanisms for repeated allocation and decision-making are gaining widespread use in many real-world settings. Our aim in this work is to study the efficiency and incentive properties of simple mechanisms based on artificial currencies …
Recent years have witnessed the rise of many successful e-commerce marketplaces like the Amazon marketplace, Uber, AirBnB, and Upwork, where a central platform mediates economic transactions between buyers and sellers. A common feature of many of …
Non-monetary mechanisms for repeated allocation and decision-making are gaining widespread use in many real-world settings. Our aim in this work is to study the efficiency and incentive properties of simple mechanisms based on artificial currencies …
We study the design of mechanisms without money for repeated allocation of resources among competing agents. Such mechanisms are gaining widespread use in allocating physical and/or computing resources in universities and companies, and also …