3 citations · 24 across the 52 of their papers we have counts for
44 papers · 1 filter
Where Should Society Draw the Line? A Social Choice Approach to Collective Consent
Chris Dong, Sonja Kraiczy, Rohit Vasishta +3
Society constantly has to determine the boundaries of what it deems acceptable, from legislative decisions to the guardrails governing autonomous systems. We initiate the axiomatic…
Approval-Based Multiwinner Voting with Candidate Qualities
Niclas Boehmer, Chris Dong, Luca Kreisel +1
We initiate the study of a new model of approval-based multiwinner voting in which each candidate carries an exogenous quality score, capturing, for instance, the reliability of th…
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…
The End Justifies the Mean: A Linear Ranking Rule for Proportional Sequential Decisions
Carmel Baharav, Niclas Boehmer, Bailey Flanigan +1
AI alignment and participatory design motivate a new democratic design problem: how to collectively choose a decision rule to use repeatedly. We study this problem for linear ranki…
Explanation Systems for Approval-Based Multiwinner Voting
Niclas Boehmer, Luca Kreisel, Jannik Peters
In approval-based multiwinner voting, voters express approval preferences over a set of candidates, and the goal is to return a winning committee. This model captures a broad range…
Computational Social Choice: Research & Development
Dorothea Baumeister, Ratip Emin Berker, Niclas Boehmer +7
Computational social choice (COMSOC) studies principled ways to aggregate conflicting individual preferences into collective decisions. In this paper, we call for an increased effo…
Fair Allocation with Initial Utilities
Niclas Boehmer, Luca Kreisel
The problem of allocating indivisible resources to agents arises in a wide range of domains, including treatment distribution and social support programs. An important goal in algo…
Single-Winner Voting on Matchings
Niclas Boehmer, Jessica Dierking
We introduce a single-winner perspective on voting on matchings, in which voters have preferences over possible matchings in a graph, and the goal is to select a single collectivel…
Understanding the Impact of Proportionality in Approval-Based Multiwinner Elections
Niclas Boehmer, Lara Glessen, Jannik Peters
Despite extensive theoretical research on proportionality in approval-based multiwinner voting, its impact on which committees and candidates can be selected in practice remains po…
Generative Social Choice: The Next Generation
Niclas Boehmer, Sara Fish, Ariel D. Procaccia
A key task in certain democratic processes is to produce a concise slate of statements that proportionally represents the full spectrum of user opinions. This task is similar to co…
Multiwinner Temporal Voting with Aversion to Change
Valentin Zech, Niclas Boehmer, Edith Elkind +1
We study two-stage committee elections where voters have dynamic preferences over candidates; at each stage, a committee is chosen under a given voting rule. We are interested in i…
Worst- and Average-Case Robustness of Stable Matchings: (Counting) Complexity and Experiments
Kimon Boehmer, Niclas Boehmer
Focusing on the bipartite Stable Marriage problem, we investigate different robustness measures related to stable matchings. We analyze the computational complexity of computing th…
Escape Sensing Games: Detection-vs-Evasion in Security Applications
Niclas Boehmer, Minbiao Han, Haifeng Xu +1
Traditional game-theoretic research for security applications primarily focuses on the allocation of external protection resources to defend targets. This work puts forward the stu…
Guide to Numerical Experiments on Elections in Computational Social Choice
Niclas Boehmer, Piotr Faliszewski, Łukasz Janeczko +7
We analyze how numerical experiments regarding elections were conducted within the computational social choice literature (focusing on papers published in the IJCAI, AAAI, and AAMA…
Approval-Based Committee Voting in Practice: A Case Study of (Over-)Representation in the Polkadot Blockchain
Niclas Boehmer, Markus Brill, Alfonso Cevallos +3
We provide the first large-scale data collection of real-world approval-based committee elections. These elections have been conducted on the Polkadot blockchain as part of their N…
Evaluation of Project Performance in Participatory Budgeting
Niclas Boehmer, Piotr Faliszewski, Łukasz Janeczko +5
We study ways of evaluating the performance of losing projects in participatory budgeting (PB) elections by seeking actions that would have led to their victory. We focus on loweri…
Robustness of Participatory Budgeting Outcomes: Complexity and Experiments
Niclas Boehmer, Piotr Faliszewski, Łukasz Janeczko +1
We study the robustness of approval-based participatory budgeting (PB) rules to random noise in the votes. Our contributions are twofold. First, we study the computational complexi…
Properties of Position Matrices and Their Elections
Niclas Boehmer, Jin-Yi Cai, Piotr Faliszewski +4
We study the properties of elections that have a given position matrix (in such elections each candidate is ranked on each position by a number of voters specified in the matrix).…
Causes of Stability in Dynamic Coalition Formation
Niclas Boehmer, Martin Bullinger, Anna Maria Kerkmann
We study the formation of stable outcomes via simple dynamics in cardinal hedonic games, where the utilities of agents change over time depending on the history of the coalition fo…
Rank Aggregation Using Scoring Rules
Niclas Boehmer, Robert Bredereck, Dominik Peters
To aggregate rankings into a social ranking, one can use scoring systems such as Plurality, Veto, and Borda. We distinguish three types of methods: ranking by score, ranking by rep…
A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski +1
Contributing to the toolbox for interpreting election results, we evaluate the robustness of election winners to random noise. We compare the robustness of different voting rules a…
A Map of Diverse Synthetic Stable Roommates Instances
Niclas Boehmer, Klaus Heeger, Stanisław Szufa
Focusing on Stable Roommates (SR) instances, we contribute to the toolbox for conducting experiments for stable matching problems. We introduce a polynomial-time computable pseudom…
Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems
Niclas Boehmer, Klaus Heeger, Rolf Niedermeier
When computing stable matchings, it is usually assumed that the preferences of the agents in the matching market are fixed. However, in many realistic scenarios, preferences change…
Stable Matching with Multilayer Approval Preferences: Approvals can be Harder than Strict Preferences
Matthias Bentert, Niclas Boehmer, Klaus Heeger +1
We study stable matching problems where agents have multilayer preferences: There are layers each consisting of one preference relation for each agent. Recently, Chen et al.…