1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.LG2023★ 1 cited
Privacy Amplification by Iteration for ADMM with (Strongly) Convex Objective Functions
T-H. Hubert Chan, Hao Xie, Mengshi Zhao
We examine a private ADMM variant for (strongly) convex objectives which is a primal-dual iterative method. Each iteration has a user with a private function used to update the pri…
cs.GT2023
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…