4 citations · 10 across the 14 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.GT2023
Practical algorithms and experimentally validated incentives for equilibrium-based fair division (A-CEEI)
Eric Budish, Ruiquan Gao, Abraham Othman +2
Approximate Competitive Equilibrium from Equal Incomes (A-CEEI) is an equilibrium-based solution concept for fair division of discrete items to agents with combinatorial demands. I…
cs.DS2023
Near Optimal Memory-Regret Tradeoff for Online Learning
Binghui Peng, Aviad Rubinstein
In the experts problem, on each of days, an agent needs to follow the advice of one of ``experts''. After each day, the loss associated with each expert's advice is reveale…
cs.DS2023
Sublinear Algorithms for TSP via Path Covers
Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein +1
We study sublinear time algorithms for the traveling salesman problem (TSP). First, we focus on the closely related {\em maximum path cover} problem, which asks for a collection of…