Niclas Boehmer

Orcid: 0000-0001-5102-449X

Affiliations:
  • Harvard University, USA
  • TU Berlin, Germany (PhD)


According to our database1, Niclas Boehmer authored at least 46 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Equilibria in schelling games: computational hardness and robustness.
Auton. Agents Multi Agent Syst., June, 2024

A Map of Diverse Synthetic Stable Matching Instances.
J. Artif. Intell. Res., 2024

Evaluating the Effectiveness of Index-Based Treatment Allocation.
CoRR, 2024

Guide to Numerical Experiments on Elections in Computational Social Choice.
CoRR, 2024

Enabling the Digital Democratic Revival: A Research Program for Digital Democracy.
CoRR, 2024

Selecting Representative Bodies: An Axiomatic View.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Approval-Based Committee Voting in Practice: A Case Study of (over-)Representation in the Polkadot Blockchain.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Stable matching with multilayer approval preferences: Approvals can be harder than strict preferences.
Games Econ. Behav., November, 2023

Fine-grained view on bribery for group identification.
Auton. Agents Multi Agent Syst., June, 2023

Application-oriented collective decision making: experimental toolbox and dynamic environments.
PhD thesis, 2023

Evaluation of Project Performance in Participatory Budgeting.
CoRR, 2023

A refined complexity analysis of fair districting over graphs.
Auton. Agents Multi Agent Syst., 2023

Robustness of Participatory Budgeting Outcomes: Complexity and Experiments.
Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

Properties of the Mallows Model Depending on the Number of Alternatives: A Warning for an Experimentalist.
Proceedings of the International Conference on Machine Learning, 2023

Subset Selection Based On Multiple Rankings in the Presence of Bias: Effectiveness of Fairness Constraints for Multiwinner Voting Score Functions.
Proceedings of the International Conference on Machine Learning, 2023

Collecting, Classifying, Analyzing, and Using Real-World Ranking Data.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

A Map of Diverse Synthetic Stable Roommates Instances.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Adapting Stable Matchings to Forced and Forbidden Pairs.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Properties of Position Matrices and Their Elections.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Rank Aggregation Using Scoring Rules.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Causes of Stability in Dynamic Coalition Formation.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
A Fine-grained View on Stable Many-to-one Matching Problems with Lower and Upper Quotas.
ACM Trans. Economics and Comput., 2022

Who won? Winner Determination and Robustness in Liquid Democracy.
CoRR, 2022

Collecting, Classifying, Analyzing, and Using Real-World Elections.
CoRR, 2022

Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Understanding Distance Measures Among Elections.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

The Complexity of Finding Fair Many-To-One Matchings.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners.
Proceedings of the Equity and Access in Algorithms, Mechanisms, and Optimization, 2022

Proportional Representation in Matching Markets: Selecting Multiple Matchings under Dichotomous Preferences.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

Multivariate Algorithmics for Eliminating Envy by Donating Goods.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Combating Collusion Rings Is Hard but Possible.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Bribery and Control in Stable Marriage.
J. Artif. Intell. Res., 2021

Equilibria in Schelling Games: Computational Complexity and Robustness.
CoRR, 2021

Finding Small Multi-Demand Set Covers with Ubiquitous Elements and Large Sets is Fixed-Parameter Tractable.
CoRR, 2021

Selecting Matchings via Multiwinner Voting: How Structure Defeats a Large Candidate Space.
CoRR, 2021

Two Influence Maximization Games on Graphs Made Temporal.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Putting a Compass on the Map of Elections.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Broadening the Research Agenda for Computational Social Choice: Multiple Preference Profiles and Multiple Solutions.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020
Entropic quadrature for moment approximations of the Boltzmann-BGK equation.
J. Comput. Phys., 2020

On the Robustness of Winners: Counting Briberies in Elections.
CoRR, 2020

Line-Up Elections: Parallel Voting with Shared Candidate Pool.
Proceedings of the Algorithmic Game Theory - 13th International Symposium, 2020

Stable Roommate Problem with Diversity Preferences.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Individual-Based Stability in Hedonic Diversity Games.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020


  Loading...