7 citations · 17 across the 14 of their papers we have counts for
14 papers
Trading Off Voting Axioms for Privacy
Zhechen Li, Ao Liu, Lirong Xia +2
In this paper, we investigate tradeoffs among differential privacy (DP) and several important voting axioms: Pareto efficiency, SD-efficiency, PC-efficiency, Condorcet consistency,…
First-Choice Maximality Meets Ex-ante and Ex-post Fairness
Xiaoxi Guo, Sujoy Sikdar, Lirong Xia +2
For the assignment problem where multiple indivisible items are allocated to a group of agents given their ordinal preferences, we design randomized mechanisms that satisfy first-c…
A separation logic for sequences in pointer programs and its decidability
Tianyue Cao, Bowen Zhang, Zhao Jin +2
Separation logic and its variants can describe various properties on pointer programs. However, when it comes to properties on sequences, one may find it hard to formalize. To deal…
Differentially Private Condorcet Voting
Zhechen Li, Ao Liu, Lirong Xia +2
Designing private voting rules is an important and pressing problem for trustworthy democracy. In this paper, under the framework of differential privacy, we propose a novel famliy…
Learning First-Order Rules with Differentiable Logic Program Semantics
Kun Gao, Katsumi Inoue, Yongzhi Cao +1
Learning first-order logic programs (LPs) from relational facts which yields intuitive insights into the data is a challenging topic in neuro-symbolic research. We introduce a nove…
Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms
Xiaoxi Guo, Sujoy Sikdar, Lirong Xia +2
In the assignment problem, the goal is to assign indivisible items to agents who have ordinal preferences, efficiently and fairly, in a strategyproof manner. In practice, first-cho…
StarVQA: Space-Time Attention for Video Quality Assessment
Fengchuang Xing, Yuan-Gen Wang, Hanpin Wang +2
The attention mechanism is blooming in computer vision nowadays. However, its application to video quality assessment (VQA) has not been reported. Evaluating the quality of in-the-…
Probabilistic Serial Mechanism for Multi-Type Resource Allocation
Xiaoxi Guo, Sujoy Sikdar, Haibin Wang +3
In multi-type resource allocation (MTRA) problems, there are p 2 types of items, and n agents, who each demand one unit of items of each type, and have strict linear preferen…
Multi-type Resource Allocation with Partial Preferences
Haibin Wang, Sujoy Sikdar, Xiaoxi Guo +3
We propose multi-type probabilistic serial (MPS) and multi-type random priority (MRP) as extensions of the well known PS and RP mechanisms to the multi-type resource allocation pro…
Reasoning about Block-based Cloud Storage Systems
Zhao Jin, Hanpin Wang, Lei Zhang +3
Owing to the massive growth in the storage demands of big data, Cloud Storage Systems (CSSs) have been put forward to improve the storage capacity. Compared with traditional storag…
FPRAS for the Potts Model and the Number of -colorings
Zonglei Bai, Yongzhi Cao, Hanpin Wang
In this paper, we give a sampling algorithm for the Potts model using Markov chains. Based on the sampling algorithm, we give \emph{FPRAS}es for the Potts model and the number of $…
The Complexity of Holant Problems over Boolean Domain with Non-negative Weights
Jiabao Lin, Hanpin Wang
Holant problem is a general framework to study the computational complexity of counting problems. We prove a complexity dichotomy theorem for Holant problems over Boolean domain wi…
Making problems tractable on big data via preprocessing with polylog-size output
Jiannan Yang, Hanpin Wang, Yongzhi Cao
To provide a dichotomy between those queries that can be made feasible on big data after appropriate preprocessing and those for which preprocessing does not help, Fan et al. devel…
Minimum guesswork discrimination between quantum states
Weien Chen, Yongzhi Cao, Hanpin Wang +1
Error probability is a popular and well-studied optimization criterion in discriminating non-orthogonal quantum states. It captures the threat from an adversary who can only query…