| Multi resource allocation with partial preferences | 0 | 0.34 | 2023 |
| Learning Mixtures of Random Utility Models with Features from Incomplete Preferences | 0 | 0.34 | 2022 |
| Certifiably robust interpretation via Rényi differential privacy | 0 | 0.34 | 2022 |
| The Semi-random Likelihood of Doctrinal Paradoxes. | 0 | 0.34 | 2022 |
| Designing Efficient and Fair Mechanisms for Multi-Type Resource Allocation. | 0 | 0.34 | 2022 |
| Learning to Design Fair and Private Voting Rules. | 0 | 0.34 | 2022 |
| Sequential Mechanisms for Multi-type Resource Allocation | 0 | 0.34 | 2021 |
| Fair And Efficient Allocations Under Lexicographic Preferences | 0 | 0.34 | 2021 |
| How Likely Are Large Elections Tied? | 0 | 0.34 | 2021 |
| Opra: An Open-Source Online Preference Reporting And Aggregation System | 0 | 0.34 | 2021 |
| The Smoothed Complexity Of Computing Kemeny And Slater Rankings | 0 | 0.34 | 2021 |
| Representative Proxy Voting | 0 | 0.34 | 2021 |
| Approximate Single-Peakedness in Large Elections | 0 | 0.34 | 2020 |
| How Private Are Commonly-Used Voting Rules? | 0 | 0.34 | 2020 |
| Dual Learning: Theoretical Study and an Algorithmic Extension | 0 | 0.34 | 2020 |
| Fair Division Through Information Withholding | 0 | 0.34 | 2020 |
| Equitable Allocations of Indivisible Chores | 0 | 0.34 | 2020 |
| Let It Snow: Adding pixel noise to protect the user’s identity | 0 | 0.34 | 2020 |
| Optimal Statistical Hypothesis Testing for Social Choice | 0 | 0.34 | 2020 |
| Leveraging Standards Based Ontological Concepts in Distributed Ledgers: A Healthcare Smart Contract Example | 1 | 0.35 | 2019 |
| Ontology Aided Smart Contract Execution for Unexpected Situations. | 0 | 0.34 | 2019 |
| Multi-Type Resource Allocation With Partial Preferences | 0 | 0.34 | 2019 |
| Equitable Allocations of Indivisible Goods. | 0 | 0.34 | 2019 |
| Strengthening Smart Contracts to Handle Unexpected Situations | 0 | 0.34 | 2019 |
| Practical Algorithms for Multi-Stage Voting Rules with Parallel Universes Tiebreaking. | 1 | 0.35 | 2019 |
| Minimizing Time-to-Rank: A Learning and Recommendation Approach. | 0 | 0.34 | 2019 |
| Learning Mixtures of Plackett-Luce Models from Structured Partial Orders | 0 | 0.34 | 2019 |
| Truth Discovery via Proxy Voting. | 0 | 0.34 | 2019 |
| A Proposal for Account Recovery in Decentralized Applications | 0 | 0.34 | 2019 |
| Near-Neighbor Methods in Random Preference Completion | 1 | 0.35 | 2019 |
| Learning Plackett-Luce Mixtures from Partial Preferences | 0 | 0.34 | 2019 |
| Differential Privacy for Eye-Tracking Data. | 4 | 0.37 | 2019 |
| Practical Algorithms for STV and Ranked Pairs with Parallel Universes Tiebreaking. | 0 | 0.34 | 2018 |
| A Mathematical Model for Optimal Decisions in a Representative Democracy. | 0 | 0.34 | 2018 |
| Learning Mixtures of Random Utility Models. | 0 | 0.34 | 2018 |
| Composite Marginal Likelihood Methods for Random Utility Models. | 1 | 0.36 | 2018 |
| Voting on multi-issue domains with conditionally lexicographic preferences. | 1 | 0.35 | 2018 |
| A Cost-Effective Framework For Preference Elicitation And Aggregation | 0 | 0.34 | 2018 |
| Mechanism Design for Multi-Type Housing Markets. | 0 | 0.34 | 2017 |
| Thwarting Vote Buying Through Decoy Ballots. | 1 | 0.63 | 2017 |
| Improving Group Decision-Making by Artificial Intelligence. | 1 | 0.35 | 2017 |
| Vote Until Two of You Agree: Mechanisms with Small Distortion and Sample Complexity. | 5 | 0.49 | 2017 |
| Thwarting Vote Buying Through Decoy Ballots - Extended Version. | 0 | 0.34 | 2017 |
| Condorcet Consistent Bundling with Social Choice. | 3 | 0.45 | 2017 |
| Optimal Decision Making with CP-nets and PCP-nets. | 1 | 0.34 | 2017 |
| Learning Mixtures of Plackett-Luce models. | 3 | 0.40 | 2016 |
| AI's 10 to Watch. | 0 | 0.34 | 2016 |
| Quantitative Extensions of the Condorcet Jury Theorem with Strategic Agents. | 1 | 0.35 | 2016 |
| Computing Optimal Bayesian Decisions for Rank Aggregation via MCMC Sampling. | 2 | 0.38 | 2015 |
| Ex post Efficiency of Random Assignments | 2 | 0.41 | 2015 |
