5 citations · 5 across the 4 of their papers we have counts for
4 papers
Game-Theoretically Secure Protocols for the Ordinal Random Assignment Problem
T-H. Hubert Chan, Ting Wen, Hao Xie +1
We study game-theoretically secure protocols for the classical ordinal assignment problem (aka matching with one-sided preference), in which each player has a total preference orde…
On (, )-Restricted Max-Min Fair Allocation Problem
T-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu
We study the max-min fair allocation problem in which a set of indivisible items are to be distributed among agents such that the minimum utility among all agents is maximi…
Online Submodular Maximization with Free Disposal: Randomization Beats 0.25 for Partition Matroids
T-H. Hubert Chan, Zhiyi Huang, Shaofeng H. -C. Jiang +2
We study the online submodular maximization problem with free disposal under a matroid constraint. Elements from some ground set arrive one by one in rounds, and the algorithm main…
Online Convex Covering and Packing Problems
T-H. Hubert Chan, Zhiyi Huang, Ning Kang
We study the online convex covering problem and online convex packing problem. The (offline) convex covering problem is modeled by the following convex program: $\min_{x \in R_+^n}…