activity
20162026
most citedThe Smoothed Possibility of Social Choice

14 citations · 66 across the 21 of their papers we have counts for

collaborators
Showing 2020Show all

10 papers · 1 filter

cs.GT2020★ 4 cited

Fair and Efficient Allocations under Lexicographic Preferences

Hadi Hosseini, Sujoy Sikdar, Rohit Vaish +1

Envy-freeness up to any good (EFX) provides a strong and intuitive guarantee of fairness in the allocation of indivisible goods. But whether such allocations always exist or whethe…

cs.GT2020★ 1 cited

Representative Proxy Voting

Elliot Anshelevich, Zack Fitzsimmons, Rohit Vaish +1

We study a model of proxy voting where the candidates, voters, and proxies are all located on the real line, and instead of voting directly, each voter delegates its vote to the cl…

cs.GT2020

How Likely Are Large Elections Tied?

Lirong Xia

Understanding the likelihood for an election to be tied is a classical topic in many disciplines including social choice, game theory, political science, and public choice. Despite…

cs.GT2020★ 3 cited

The Smoothed Complexity of Computing Kemeny and Slater Rankings

Lirong Xia, Weiqiang Zheng

The computational complexity of winner determination under common voting rules is a classical and fundamental topic in the field of computational social choice. Previous work has e…

cs.GT2020★ 14 cited

The Smoothed Possibility of Social Choice

Lirong Xia

We develop a framework that leverages the smoothed complexity analysis by Spielman and Teng to circumvent paradoxes and impossibility theorems in social choice, motivated by modern…

cs.LG2020

Learning Mixtures of Random Utility Models with Features from Incomplete Preferences

Zhibing Zhao, Ao Liu, Lirong Xia

Random Utility Models (RUMs), which subsume Plackett-Luce model (PL) as a special case, are among the most popular models for preference learning. In this paper, we consider RUMs w…

cs.MA2020★ 1 cited

OPRA: An Open-Source Online Preference Reporting and Aggregation System

Yiwei Chen, Jingwen Qian, Junming Wang +2

We introduce the Online Preference Reporting and Aggregation (OPRA) system, an open-source online system that aims at providing support for group decision-making. We illustrate OPR…

cs.LG2020★ 2 cited

Dual Learning: Theoretical Study and an Algorithmic Extension

Zhibing Zhao, Yingce Xia, Tao Qin +2

Dual learning has been successfully applied in many machine learning applications including machine translation, image-to-image transformation, etc. The high-level idea of dual lea…

cs.GT2020★ 1 cited

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…

cs.GT2020★ 12 cited

Equitable Allocations of Indivisible Chores

Rupert Freeman, Sujoy Sikdar, Rohit Vaish +1

We study fair allocation of indivisible chores (i.e., items with non-positive value) among agents with additive valuations. An allocation is deemed fair if it is (approximately) eq…