activity
20192022
most citedEnvy-freeness up to any item with high Nash welfare: The virtue of donating items

31 citations · 39 across the 5 of their papers we have counts for

collaborators

7 papers

cs.GT20221 cited

On picking sequences for chores

Uriel Feige, Xin Huang

We consider the problem of allocating indivisible chores to agents with additive disvaluation (cost) functions. It is easy to show that there are picking sequences that giv…

cs.GT2022

A Discrete and Bounded Locally Envy-Free Cake Cutting Protocol on Trees

Ganesh Ghalme, Xin Huang, Yuka Machino +1

We study the classic problem of \emph{fairly} dividing a heterogeneous and divisible resource -- modeled as a line segment and typically called as a \emph{cake} -- among $n…

cs.GT20215 cited

Unified Fair Allocation of Goods and Chores via Copies

Yotam Gafni, Xin Huang, Ron Lavi +1

We consider fair allocation of indivisible items in a model with goods, chores, and copies, as a unified framework for studying: (1)~the existence of EFX and other solution concept…

math.OC2020

Scenario-decomposition Solution Framework for Nonseparable Stochastic Control Problems

Xin Huang, Duan Li, Daniel Zhuoyu Long

When stochastic control problems do not possess separability and/or monotonicity, the dynamic programming pioneered by Bellman in 1950s fails to work as a time-decomposition soluti…

cs.GT2019

The Constrained Round Robin Algorithm for Fair and Efficient Allocation

Haris Aziz, Xin Huang, Nicholas Mattei +1

We consider a multi-agent resource allocation setting that models the assignment of papers to reviewers. A recurring issue in allocation problems is the compatibility of welfare/ef…

eess.SY20192 cited

Revised Progressive-Hedging-Algorithm Based Two-layer Solution Scheme for Bayesian Reinforcement Learning

Xin Huang, Duan Li, Daniel Zhuoyu Long

Stochastic control with both inherent random system noise and lack of knowledge on system parameters constitutes the core and fundamental topic in reinforcement learning (RL), espe…