14 citations · 63 across the 27 of their papers we have counts for
7 papers · 1 filter
Strategyproof Mechanism for Two Heterogeneous Facilities with Constant Approximation Ratio
Minming Li, Pinyan Lu, Yuhao Yao +1
In this paper, we study the two-facility location game on a line with optional preference where the acceptable set of facilities for each agent could be different and an agent's co…
A Quantum-inspired Classical Algorithm for Separable Non-negative Matrix Factorization
Zhihuai Chen, Yinan Li, Xiaoming Sun +2
Non-negative Matrix Factorization (NMF) asks to decompose a (entry-wise) non-negative matrix into the product of two smaller-sized nonnegative matrices, which has been shown intrac…
Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol
Xiaohui Bei, Xiaoming Sun, Hao Wu +3
The classical cake cutting problem studies how to find fair allocations of a heterogeneous and divisible resource among multiple agents. Two of the most commonly studied fairness c…
A Linear Algorithm for Finding the Sink of Unique Sink Orientations on Grids
Xiaoming Sun, Jialin Zhang, Zhijie Zhang
An orientation of a grid is called unique sink orientation (USO) if each of its nonempty subgrids has a unique sink. Particularly, the original grid itself has a unique global sink…
Efficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising
Jia Zhang, Zheng Wang, Qian Li +4
In this work, we study the guaranteed delivery model which is widely used in online display advertising. In the guaranteed delivery scenario, ad exposures (which are also called im…
How to select the largest k elements from evolving data?
Qin Huang, Xingwu Liu, Xiaoming Sun +1
In this paper we investigate the top--selection problem, i.e. determine the largest, second largest, ..., and the -th largest elements, in the dynamic data model. In this mod…
Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol
Xiaoming Sun, Jia Zhang, Jialin Zhang
The classical secretary problem investigates the question of how to hire the best secretary from candidates who come in a uniformly random order. In this work we investigate a…