Related papers: Approximating Competitive Equilibrium by Nash Welf…
We study the power of item-pricing as a tool for approximately optimizing social welfare in a combinatorial market. We consider markets with $m$ indivisible items and $n$ buyers. The goal is to set prices to the items so that, when agents…
The classic cake-cutting problem provides a model for addressing fair and efficient allocation of a divisible, heterogeneous resource (metaphorically, the cake) among agents with distinct preferences. Focusing on a standard formulation of…
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…
We consider the problem of allocating divisible items among multiple agents, and consider the setting where any agent is allowed to introduce diversity constraints on the items they are allocated. We motivate this via settings where the…
Social commerce platforms are emerging businesses where producers sell products through re-sellers who advertise the products to other customers in their social network. Due to the increasing popularity of this business model, thousands of…
Based on the observation that many existing discrete choice models admit a welfare function of utilities whose gradient gives the choice probability vector, we propose a new representation of discrete choice model which we call the…
In classical job-scheduling games, each job behaves as a selfish player, choosing a machine to minimize its own completion time. To reduce the equilibria inefficiency, coordination mechanisms are employed, allowing each machine to follow…
Allocating indivisible goods is a ubiquitous task in fair division. We study additive welfarist rules, an important class of rules which choose an allocation that maximizes the sum of some function of the agents' utilities. Prior work has…
We study fair division of indivisible goods in a single-parameter environment. In particular, we develop truthful social welfare maximizing mechanisms for fairly allocating indivisible goods. Our fairness guarantees are in terms of solution…
This paper is about allocation of an infinitely divisible good to several rational and strategic agents. The allocation is done by a social planner who has limited information because the agents' valuation functions are taken to be private…
We study the problem of fair allocation of indivisible items when agents have ternary additive valuations -- each agent values each item at some fixed integer values $a$, $b$, or $c$ that are common to all agents. The notions of fairness we…
We introduce a new class of games called the networked common goods game (NCGG), which generalizes the well-known common goods game. We focus on a fairly general subclass of the game where each agent's utility functions are the same across…
We study fair allocation of resources consisting of both divisible and indivisible goods to agents with additive valuations. When only divisible or indivisible goods exist, it is known that an allocation that achieves the maximum Nash…
Collaborative Edge Computing (CEC) is an effective method that improves the performance of Mobile Edge Computing (MEC) systems by offloading computation tasks from busy edge servers (ESs) to idle ones. However, ESs usually belong to…
We consider a market in which both suppliers and consumers compete for a product via scalar-parameterized supply offers and demand bids. Scalar-parameterized offers/bids are appealing due to their modeling simplicity and desirable…
Nash equilibrium serves as a fundamental mathematical tool in economics and game theory. However, it classically assumes knowledge of player utilities, whereas economics generally regards preferences as more fundamental. To leverage…
In this paper, we consider microgrids that interconnect prosumers with distributed energy resources and dynamic loads. Prosumers are connected through the microgrid to trade energy and gain profit while respecting the network constraints.…
We consider the problem of approximating maximum Nash social welfare (NSW) while allocating a set of indivisible items to $n$ agents. The NSW is a popular objective that provides a balanced tradeoff between the often conflicting…
Many economic transactions, including those of online markets, have a time lag between the start and end times of transactions. Customers need to wait for completion of their transaction (order fulfillment) and hence are also interested in…
We investigate both stationary and time-varying, nonmonotone generalized Nash equilibrium problems that exhibit symmetric interactions among the agents, which are known to be potential. As may happen in practical cases, however, we envision…