4 papers
Game-Theoretically Secure Distributed Protocols for Fair Allocation in Coalitional Games
T-H. Hubert Chan, Qipeng Kuang, Quan Xue
We consider game-theoretically secure distributed protocols for coalition games that approximate the Shapley value with small multiplicative error. Since all known existing approxi…
Symmetric Splendor: Unraveling Universally Closest Refinements and Fisher Market Equilibrium through Density-Friendly Decomposition
T-H. Hubert Chan, Quan Xue
We present a comprehensive framework that unifies several research areas within the context of vertex-weighted bipartite graphs, providing deeper insights and improved solutions. T…
Fully Dynamic Algorithms for Euclidean Steiner Tree
T-H. Hubert Chan, Gramoz Goranci, Shaofeng H. -C. Jiang +2
The Euclidean Steiner tree problem asks to find a min-cost metric graph that connects a given set of \emph{terminal} points in , possibly using points not in …
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…