We study fair allocation of indivisible goods among agents. Prior research focuses on
additive agent preferences, which leads to an impossibility when seeking truthfulness …

We present the first constant-factor approximation algorithm for maximizing the Nash social
welfare when allocating indivisible items to agents with budget-additive valuation functions …

A well-studied nonlinear extension of the minimum-cost flow problem is to minimize the
objective∑ ij∈ E Cij (fij) over feasible flows f, where on every arc ij of the network, Cij is a …

We present a strongly polynomial algorithm for computing an equilibrium in Arrow-Debreu
exchange markets with linear utilities. Our algorithm is based on a variant of the weakly …

We study the fair division problem of allocating a mixed manna under additively separable
piecewise linear concave (SPLC) utilities. A mixed manna contains goods that everyone …

We study the problem of allocating divisible bads (chores) among multiple agents with
additive utilities when monetary transfers are not allowed. The competitive rule is known for …

Fair division is the problem of allocating a set of items among a set of agents in a fair and
efficient way. It arises naturally in a wide range of real-life settings. Competitive equilibrium …

Our first result shows membership in PPAD for the problem of computing approximate
equilibria for an Arrow-Debreu exchange market for piecewise-linear concave (PLC) utility …

The spatial price equilibrium modeling framework, which emphasizes the importance of
transportation costs between markets, has been utilized in agricultural, energy, mineral as …

A strongly polynomial algorithm is given for the generalized flow maximization problem. It
uses a new variant of the scaling technique, called continuous scaling. The main measure of …