
Truthful Information Elicitation from Hybrid Crowds
Suppose a decision maker wants to predict weather tomorrow by eliciting ...
read it

A Smoothed Impossibility Theorem on Condorcet Criterion and Participation
In 1988, Moulin proved an insightful and surprising impossibility theore...
read it

Certifiably Robust Interpretation via Renyi Differential Privacy
Motivated by the recent discovery that the interpretation maps of CNNs c...
read it

Smoothed Differential Privacy
Differential privacy (DP) is a widelyaccepted and widelyapplied notion...
read it

Strategic Behavior is Bliss: Iterative Voting Improves Social Welfare
Recent work in iterative voting has defined the difference in social wel...
read it

The Smoothed Satisfaction of Voting Axioms
We initiate the work towards a comprehensive picture of the smoothed sat...
read it

The Smoothed Likelihood of Doctrinal Paradox
When aggregating logically interconnected judgments from n agents, the r...
read it

Sequential Mechanisms for Multitype Resource Allocation
Several resource allocation problems involve multiple types of resources...
read it

Fair and Efficient Allocations under Lexicographic Preferences
Envyfreeness up to any good (EFX) provides a strong and intuitive guara...
read it

Representative Proxy Voting
We study a model of proxy voting where the candidates, voters, and proxi...
read it

How Likely Are Large Elections Tied?
Understanding the likelihood for an election to be tied is a classical t...
read it

The Smoothed Complexity of Computing Kemeny and Slater Rankings
The computational complexity of winner determination under common voting...
read it

Optimal Statistical Hypothesis Testing for Social Choice
We address the following question in this paper: "What are the most robu...
read it

The Smoothed Possibility of Social Choice
We develop a framework to leverage the elegant "worst averagecase" idea...
read it

Learning Mixtures of PlackettLuce Models with Features from Topl Orders
PlackettLuce model (PL) is one of the most popular models for preferenc...
read it

OPRA: An OpenSource Online Preference Reporting and Aggregation System
We introduce the Online Preference Reporting and Aggregation (OPRA) syst...
read it

Dual Learning: Theoretical Study and an Algorithmic Extension
Dual learning has been successfully applied in many machine learning app...
read it

Probabilistic Serial Mechanism for MultiType Resource Allocation
In multitype resource allocation (MTRA) problems, there are p ≥ 2 types...
read it

Equitable Allocations of Indivisible Chores
We study fair allocation of indivisible chores (i.e., items with nonpos...
read it

Learning Mixtures of PlackettLuce Models from Structured Partial Orders
Mixtures of ranking models have been widely used for heterogeneous prefe...
read it

Fair Division through Information Withholding
Envyfreeness up to one good (EF1) is a wellstudied fairness notion for...
read it

Multitype Resource Allocation with Partial Preferences
We propose multitype probabilistic serial (MPS) and multitype random p...
read it

Minimizing TimetoRank: A Learning and Recommendation Approach
Consider the following problem faced by an online voting platform: A use...
read it

Equitable Allocations of Indivisible Goods
In fair division, equitability dictates that each participant receives t...
read it

Truth Discovery via Proxy Voting
Truth discovery is a general name for a broad range of statistical metho...
read it

Differential Privacy for EyeTracking Data
As large eyetracking datasets are created, data privacy is a pressing c...
read it

Practical Algorithms for MultiStage Voting Rules with Parallel Universes Tiebreaking
STV and ranked pairs (RP) are two wellstudied voting rules for group de...
read it

A Mathematical Model for Optimal Decisions in a Representative Democracy
Direct democracy is a special case of an ensemble of classifiers, where ...
read it

Towards NonParametric Learning to Rank
This paper studies a stylized, yet natural, learningtorank problem and...
read it

Composite Marginal Likelihood Methods for Random Utility Models
We propose a novel and flexible rankbreakingthencompositemarginalli...
read it

Practical Algorithms for STV and Ranked Pairs with Parallel Universes Tiebreaking
STV and ranked pairs (RP) are two wellstudied voting rules for group de...
read it

How Private Is Your Voting? A Framework for Comparing the Privacy of Voting Mechanisms
Voting privacy has received a lot of attention across several research c...
read it

A CostEffective Framework for Preference Elicitation and Aggregation
We propose a costeffective framework for preference elicitation and agg...
read it

Welfare of Sequential Allocation Mechanisms for Indivisible Goods
Sequential allocation is a simple and attractive mechanism for the alloc...
read it

Allocating Indivisible Items in Categorized Domains
We formulate a general class of allocation problems called categorized d...
read it

Possible and Necessary Allocations via Sequential Mechanisms
A simple mechanism for allocating indivisible resources is sequential al...
read it

A Statistical DecisionTheoretic Framework for Social Choice
In this paper, we take a statistical decisiontheoretic viewpoint on soc...
read it

Determining Possible and Necessary Winners Given Partial Orders
Usually a voting rule requires agents to give their preferences as linea...
read it

Random Utility Theory for Social Choice
Random utility theory models an agent's preferences on alternatives by d...
read it

How Many Vote Operations Are Needed to Manipulate A Voting System?
In this paper, we propose a framework to study a general class of strate...
read it

Combining Voting Rules Together
We propose a simple method for combining together voting rules that perf...
read it

Price Updating in Combinatorial Prediction Markets with Bayesian Networks
To overcome the #Phardness of computing/updating prices in logarithm ma...
read it

New Candidates Welcome! Possible Winners with respect to the Addition of New Candidates
In voting contexts, some new candidates may show up in the course of the...
read it

Dominating Manipulations in Voting with Partial Information
We consider manipulation problems when the manipulator only has partial ...
read it

Manipulation of Nanson's and Baldwin's Rules
Nanson's and Baldwin's voting rules select a winner by successively elim...
read it

Incentive Compatible Budget Elicitation in Multiunit Auctions
In this paper, we consider the problem of designing incentive compatible...
read it
Lirong Xia
is this you? claim profile
Assistant professor, Computer Science Department at Rensselaer Polytechnic Institute (RPI)