Lirong Xia

Orcid: 0000-0002-9800-6691

According to our database1, Lirong Xia authored at least 169 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Computing Most Equitable Voting Rules.
CoRR, 2024

Average-Case Analysis of Iterative Voting.
CoRR, 2024

Differentially Private Approval-Based Committee Voting.
CoRR, 2024

Computational Complexity of Verifying the Group No-show Paradox.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Determining Winners in Elections with Absent Votes.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Distribution of Chores with Information Asymmetry.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

2023
The possible winner with uncertain weights problem.
J. Comput. Syst. Sci., December, 2023

A practical multi-objective auction design and optimization framework for sponsored search.
Oper. Res. Lett., November, 2023

Smoothed Differential Privacy.
Trans. Mach. Learn. Res., 2023

Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms.
J. Artif. Intell. Res., 2023

LLM-augmented Preference Learning from Natural Language.
CoRR, 2023

Trading Off Voting Axioms for Privacy.
CoRR, 2023

Accelerating Majority Voting by Quantum Computation.
CoRR, 2023

Multi resource allocation with partial preferences.
Artif. Intell., 2023

Accelerating Voting by Quantum Computation.
Proceedings of the Uncertainty in Artificial Intelligence, 2023

The Impact of a Coalition: Assessing the Likelihood of Voter Influence in Large Elections.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

The Wisdom of Strategic Voting.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Learning to Design Fair and Private Voting Rules (Extended Abstract).
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Convergence in Multi-Issue Iterative Voting under Uncertainty.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

First-Choice Maximality Meets Ex-ante and Ex-post Fairness.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Average Envy-freeness for Indivisible Items.
Proceedings of the 3rd ACM Conference on Equity and Access in Algorithms, 2023

Learning to Explain Voting Rules.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Fairly Dividing Mixtures of Goods and Chores under Lexicographic Preferences.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Semi-random Impossibilities of Condorcet Criterion.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Frustratingly Easy Truth Discovery.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Differentially Private Condorcet Voting.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Learning to Design Fair and Private Voting Rules.
J. Artif. Intell. Res., 2022

Hide, Not Seek: Perceived Fairness in Envy-Free Allocations of Indivisible Goods.
CoRR, 2022

Fair and Fast Tie-Breaking for Voting.
CoRR, 2022

How Likely A Coalition of Voters Can Influence A Large Election?
CoRR, 2022

Certifiably robust interpretation via Rényi differential privacy.
Artif. Intell., 2022

Beyond the Worst Case: Semi-random Complexity Analysis of Winner Determination.
Proceedings of the Web and Internet Economics - 18th International Conference, 2022

Learning Mixtures of Random Utility Models with Features from Incomplete Preferences.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Crowdsourcing Perceptions of Gerrymandering.
Proceedings of the Tenth AAAI Conference on Human Computation and Crowdsourcing, 2022

Anti-Malware Sandbox Games.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

Designing Efficient and Fair Mechanisms for Multi-Type Resource Allocation.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

The Semi-random Likelihood of Doctrinal Paradoxes.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Dual Learning: Theoretical Study and an Algorithmic Extension.
SN Comput. Sci., 2021

How Private Are Commonly-Used Voting Rules?
IACR Cryptol. ePrint Arch., 2021

Favoring Eagerness for Remaining Items: Achieving Efficient and Fair Assignments.
CoRR, 2021

Truthful Information Elicitation from Hybrid Crowds.
CoRR, 2021

A Smoothed Impossibility Theorem on Condorcet Criterion and Participation.
CoRR, 2021

Smoothed Differential Privacy.
CoRR, 2021

The Smoothed Satisfaction of Voting Axioms.
CoRR, 2021

The Smoothed Likelihood of Doctrinal Paradoxes.
CoRR, 2021

Probabilistic serial mechanism for multi-type resource allocation.
Auton. Agents Multi Agent Syst., 2021

How Likely Are Large Elections Tied?
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

The Semi-Random Satisfaction of Voting Axioms.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Strategic Behavior is Bliss: Iterative Voting Improves Social Welfare.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Sequential Mechanisms for Multi-type Resource Allocation.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

The Smoothed Complexity of Computing Kemeny and Slater Rankings.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Fair and Efficient Allocations under Lexicographic Preferences.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

OPRA: An Open-Source Online Preference Reporting and Aggregation System.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Representative Proxy Voting.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Learning Mixtures of Plackett-Luce Models with Features from Top-$l$ Orders.
CoRR, 2020

Optimal Statistical Hypothesis Testing for Social Choice.
Proceedings of the Thirty-Sixth Conference on Uncertainty in Artificial Intelligence, 2020

The Smoothed Possibility of Social Choice.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Approximate Single-Peakedness in Large Elections.
Proceedings of the 2020 IEEE International Conference on Knowledge Graph, 2020

Let It Snow: Adding pixel noise to protect the user's identity.
Proceedings of the ETRA '20 Adjunct: 2020 Symposium on Eye Tracking Research and Applications, 2020

Equitable Allocations of Indivisible Chores.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Multi-Type Resource Allocation with Partial Preferences.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Fair Division Through Information Withholding.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Learning and Decision-Making from Rank Data
Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers, ISBN: 978-3-031-01582-3, 2019

Providing Appropriate Social Support to Prevention of Depression for Highly Anxious Sufferers.
IEEE Trans. Comput. Soc. Syst., 2019

Fair Division through Information Withholding.
CoRR, 2019

Truth Discovery via Proxy Voting.
CoRR, 2019

Ontology Aided Smart Contract Execution for Unexpected Situations.
Proceedings of the Blockchain enabled Semantic Web Workshop (BlockSW) and Contextualized Knowledge Graphs (CKG) Workshop co-located with the 18th International Semantic Web Conference, 2019

Learning Mixtures of Plackett-Luce Models from Structured Partial Orders.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Equitable Allocations of Indivisible Goods.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Minimizing Time-to-Rank: A Learning and Recommendation Approach.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Differential privacy for eye-tracking data.
Proceedings of the 11th ACM Symposium on Eye Tracking Research & Applications, 2019

Strengthening Smart Contracts to Handle Unexpected Situations.
Proceedings of the IEEE International Conference on Decentralized Applications and Infrastructures, 2019

Leveraging Standards Based Ontological Concepts in Distributed Ledgers: A Healthcare Smart Contract Example.
Proceedings of the IEEE International Conference on Decentralized Applications and Infrastructures, 2019

A Proposal for Account Recovery in Decentralized Applications.
Proceedings of the IEEE International Conference on Blockchain, 2019

Practical Algorithms for Multi-Stage Voting Rules with Parallel Universes Tiebreaking.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Mechanism Design for Multi-Type Housing Markets with Acceptable Bundles.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Learning Plackett-Luce Mixtures from Partial Preferences.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Near-Neighbor Methods in Random Preference Completion.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Towards Non-Parametric Learning to Rank.
CoRR, 2018

Practical Algorithms for STV and Ranked Pairs with Parallel Universes Tiebreaking.
CoRR, 2018

How Private Is Your Voting? A Framework for Comparing the Privacy of Voting Mechanisms.
CoRR, 2018

Voting on multi-issue domains with conditionally lexicographic preferences.
Artif. Intell., 2018

A Cost-Effective Framework for Preference Elicitation and Aggregation.
Proceedings of the Thirty-Fourth Conference on Uncertainty in Artificial Intelligence, 2018

A Mathematical Model For Optimal Decisions In A Representative Democracy.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Composite Marginal Likelihood Methods for Random Utility Models.
Proceedings of the 35th International Conference on Machine Learning, 2018

Learning Mixtures of Random Utility Models.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Improving Group Decision-Making by Artificial Intelligence.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Thwarting Vote Buying Through Decoy Ballots.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Optimal Decision Making with CP-nets and PCP-nets.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Condorcet Consistent Bundling with Social Choice.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Thwarting Vote Buying Through Decoy Ballots - Extended Version.
Proceedings of the Autonomous Agents and Multiagent Systems, 2017

Mechanism Design for Multi-Type Housing Markets.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Vote Until Two of You Agree: Mechanisms with Small Distortion and Sample Complexity.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Voting in Combinatorial Domains.
Proceedings of the Handbook of Computational Social Choice, 2016

Incentive Mechanism Design for Crowdsourcing: An All-Pay Auction Approach.
ACM Trans. Intell. Syst. Technol., 2016

AI's 10 to Watch.
IEEE Intell. Syst., 2016

Bayesian Estimators As Voting Rules.
Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence, 2016

Allocating Indivisible Items in Categorized Domains.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Learning Mixtures of Plackett-Luce Models.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Welfare of Sequential Allocation Mechanisms for Indivisible Goods.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Quantitative Extensions of the Condorcet Jury Theorem with Strategic Agents.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Computing Optimal Bayesian Decisions for Rank Aggregation via MCMC Sampling.
Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, 2015

Generalized Decision Scoring Rules: Statistical, Computational, and Axiomatic Properties.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Possible and Necessary Allocations via Sequential Mechanisms.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Computing Manipulations of Ranking Systems.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Ex post Efficiency of Random Assignments.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014
Structure and complexity of ex post efficient random assignments.
CoRR, 2014

Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules.
Artif. Intell., 2014

A Multiswarm Competitive Particle Swarm Algorithm for Optimization Control of an ethylene cracking Furnace.
Appl. Artif. Intell., 2014

A Statistical Decision-Theoretic Framework for Social Choice.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Assigning indivisible and categorized items.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

Profit-maximizing incentive for participatory sensing.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

Computing Parametric Ranking Models via Rank-Breaking.
Proceedings of the 31th International Conference on Machine Learning, 2014

Fixed-parameter tractability of integer generalized scoring rules.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

Efficient Inference for Complex Queries on Complex Distributions.
Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics, 2014

Preface.
Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

2013
Generalized scoring rules: a framework that reconciles Borda and Condorcet.
SIGecom Exch., 2013

Probabilistic automata for computing with words.
J. Comput. Syst. Sci., 2013

Preference Elicitation For General Random Utility Models.
Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, 2013

Generalized Method-of-Moments for Rank Aggregation.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Designing social choice mechanisms using machine learning.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Strategic Behavior when Allocating Indivisible Goods Sequentially.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
New candidates welcome! Possible winners with respect to the addition of new candidates.
Math. Soc. Sci., 2012

How Many Vote Operations Are Needed to Manipulate A Voting System?
CoRR, 2012

Generalized Weighted Model Counting: An Efficient Monte-Carlo meta-algorithm (Working Paper).
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Computing the margin of victory for various voting rules.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Random Utility Theory for Social Choice.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

Paradoxes of Multiple Elections: An Approximation Approach.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

Approximating Common Voting Rules by Sequential Voting in Multi-Issue Domains.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012

Combining Voting Rules Together.
Proceedings of the ECAI 2012, 2012

The Possible Winner Problem with Uncertain Weights.
Proceedings of the ECAI 2012, 2012

Aggregating Conditionally Lexicographic Preferences on Multi-issue Domains.
Proceedings of the Principles and Practice of Constraint Programming, 2012

MPSO-Based Operational Conditions Optimization in Chemical Process: A Case Study.
Proceedings of the Artificial Intelligence and Computational Intelligence, 2012

Lot-based voting rules.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Generalized Weighted Model Counting: An Efficient Monte-Carlo Meta-Algorithm.
Proceedings of the Machine Aggregation of Human Judgment, 2012

Evaluating Resistance to False-Name Manipulations in Elections.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

A Complexity-of-Strategic-Behavior Comparison between Schulze's Rule and Ranked Pairs.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Determining Possible and Necessary Winners Given Partial Orders.
J. Artif. Intell. Res., 2011

Price Updating in Combinatorial Prediction Markets with Bayesian Networks.
Proceedings of the UAI 2011, 2011

Strategic sequential voting in multi-issue domains and multiple-election paradoxes.
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

An Efficient Monte-Carlo Algorithm for Pricing Combinatorial Prediction Markets for Tournaments.
Proceedings of the IJCAI 2011, 2011

A Maximum Likelihood Approach towards Aggregating Partial Orders.
Proceedings of the IJCAI 2011, 2011

Hypercubewise Preference Aggregation in Multi-Issue Domains.
Proceedings of the IJCAI 2011, 2011

Possible winners when new alternatives join: new results coming up!
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

Manipulation of Nanson's and Baldwin's Rules.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

Dominating Manipulations in Voting with Partial Information.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Strategy-Proof Voting Rules over Multi-issue Domains with Restricted Preferences.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Incentive Compatible Budget Elicitation in Multi-unit Auctions.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

A scheduling approach to coalitional manipulation.
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Aggregating preferences in multi-issue domains by using maximum likelihood estimators.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

Stackelberg Voting Games: Computational Aspects and Paradoxes.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Compilation Complexity of Common Voting Rules.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Computational Social Choice: Strategic and Combinatorial Aspects.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Efficient Algorithms for Reconstructing Zero-Recombinant Haplotypes on a Pedigree Based on Fast Elimination of Redundant Linear Equations.
SIAM J. Comput., 2009

Sequential composition of voting rules in multi-issue domains.
Math. Soc. Sci., 2009

Complexity of Unweighted Coalitional Manipulation under Some Common Voting Rules.
Proceedings of the IJCAI 2009, 2009

A Dichotomy Theorem on the Existence of Efficient or Neutral Sequential Voting Correspondences.
Proceedings of the IJCAI 2009, 2009

Finite Local Consistency Characterizes Generalized Scoring Rules.
Proceedings of the IJCAI 2009, 2009

Preference Functions that Score Rankings and Maximum Likelihood Estimation.
Proceedings of the IJCAI 2009, 2009

How Hard Is It to Control Sequential Elections via the Agenda?
Proceedings of the IJCAI 2009, 2009

2008
Generalized scoring rules and the frequency of coalitional manipulability.
Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

A sufficient condition for voting rules to be frequently manipulable.
Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

Voting on Multiattribute Domains with Cyclic Preferential Dependencies.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

Determining Possible and Necessary Winners under Common Voting Rules Given Partial Orders.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Sequential voting rules and multiple elections paradoxes.
Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2007), 2007

Fast elimination of redundant linear equations and reconstruction of recombination-free mendelian inheritance on a pedigree.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Strongly Decomposable Voting Rules on Multiattribute Domains.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
On minimal models of the Region Connection Calculus.
Fundam. Informaticae, 2006

2003
Image orientation detection with integrated human perception cues (or which way is up).
Proceedings of the 2003 International Conference on Image Processing, 2003


  Loading...