
Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores
Competitive equilibrium with equal income (CEEI) is considered one of th...
read it

Improving EFX Guarantees through Rainbow Cycle Number
We study the problem of fairly allocating a set of indivisible goods amo...
read it

Competitive Allocation of a Mixed Manna
We study the fair division problem of allocating a mixed manna under add...
read it

Dividing Bads is Harder than Dividing Goods: On the Complexity of Fair and Efficient Division of Chores
We study the chore division problem where a set of agents needs to divid...
read it

Approximating Maximin Shares with Mixed Manna
We initiate the study of fair allocations of a mixed manna under the pop...
read it

Fair and Efficient Allocations under Subadditive Valuations
We study the problem of allocating a set of indivisible goods among agen...
read it

Online Revenue Maximization for Server Pricing
Efficient and truthful mechanisms to price resources on remote servers/m...
read it

Fast Algorithms for Rank1 Bimatrix Games
The rank of a bimatrix game is the matrix rank of the sum of the two pay...
read it

Unique End of Potential Line
This paper studies the complexity of problems in PPAD ∩ PLS that have un...
read it

Smoothed Efficient Algorithms and Reductions for Network Coordination Games
Worstcase hardness results for most equilibrium computation problems ha...
read it

Nash Equilibrium in Smoothed Polynomial Time for Network Coordination Games
Extensive work in the last two decades has led to deep insights into the...
read it

Resource Allocation Game on Social Networks: Best Response Dynamics and Convergence
The decisions that human beings make to allocate time has significant be...
read it

SumofSquares meets Nash: Optimal Lower Bounds for Finding any Equilibrium
Several works have shown unconditional hardness (via integrality gaps) o...
read it

Eliciting Binary Performance Metrics
Given a binary prediction problem, which performance metric should the c...
read it

Maximizing Profit with Convex Costs in the Randomorder Model
Suppose a set of requests arrives online: each request gives some value ...
read it

End of Potential Line
We introduce the problem EndOfPotentialLine and the corresponding comple...
read it

Universal Growth in Production Economies
We study a simple variant of the von Neumann model of an expanding econo...
read it

Social Welfare and Profit Maximization from Revealed Preferences
Consider the seller's problem of finding "optimal" prices for her (divis...
read it
Ruta Mehta
is this you? claim profile