activity
20062023
most citedDetermining Possible and Necessary Winners Given Partial Orders

175 citations · 571 across the 44 of their papers we have counts for

collaborators

44 papers

cs.GT2023

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,…

cs.GT2023★ 3 cited

The Wisdom of Strategic Voting

Qishen Han, Grant Schoenebeck, Biaoshuai Tao +1

We study the voting game where agents' preferences are endogenously decided by the information they receive, and they can collaborate in a group. We show that strategic voting beha…

cs.GT2023

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…

cs.GT2023

Average Envy-freeness for Indivisible Items

Qishen Han, Biaoshuai Tao, Lirong Xia

In fair division applications, agents may have unequal entitlements reflecting their different contributions. Moreover, the contributions of agents may depend on the allocation its…

cs.GT2023

Convergence of Multi-Issue Iterative Voting under Uncertainty

Joshua Kavner, Reshef Meir, Francesca Rossi +1

We study the effect of strategic behavior in iterative voting for multiple issues under uncertainty. We introduce a model synthesizing simultaneous multi-issue voting with Meir, Le…

cs.CY2023

Accelerating Voting by Quantum Computation

Ao Liu, Qishen Han, Lirong Xia +1

Studying the computational complexity and designing fast algorithms for determining winners under voting rules are classical and fundamental questions in computational social choic…