6 papers
Efficient and Envy-free Random Assignment Beyond Expected Utility
Patrick Becker, Felix Brandt, Satyanand Rammohan
We consider the random assignment problem with abstract continuous and convex preferences. In particular, we admit preference relations that are not constrained by independence or…
Fractional Pareto-Optimality in Multiwinner Voting
Patrick Becker, Niclas Boehmer, Fabian Frank +1
Efficiency in multiwinner voting is most naturally captured by Pareto-optimality (PO), yet this notion is computationally and structurally difficult to handle. We therefore study f…
Core Existence in Approval-Based Committee Elections with up to Seven Voter Types
Patrick Becker, Matthias Greger, Dominik Peters
In an approval-based committee election, the task is to select a committee of up to candidates from a set of candidates based on the preferences of voters, each of whom…
Efficiently Computing Equilibria in Budget-Aggregation Games
Patrick Becker, Alexander Fries, Matthias Greger +1
Budget aggregation deals with the social choice problem of distributing an exogenously given budget among a set of public projects, given agents' preferences. Taking a game-theoret…
On Minimal Achievable Quotas in Multiwinner Voting
Patrick Becker, Fabian Frank
Justified representation (JR) and extended justified representation (EJR) are well-established proportionality axioms in approval-based multiwinner voting. Both axioms are always s…
Three Months in the Life of Cloud Quantum Computing
Darrell Teegarden, Allison Casey, F. Gino Serpa +4
Quantum Computing (QC) has evolved from a few custom quantum computers, which were only accessible to their creators, to an array of commercial quantum computers that can be access…