Ulrike Schmidt-Kraepelin

Orcid: 0000-0002-9213-7746

Affiliations:
  • Eindhoven University of Technology, The Netherlands
  • SLMath, Berkeley, USA (former)
  • Universidad de Chile (former)
  • TU Berlin, Germany (former)


According to our database1, Ulrike Schmidt-Kraepelin authored at least 28 papers between 2019 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
City Sampling for Citizens' Assemblies.
CoRR, September, 2025

New Combinatorial Insights for Monotone Apportionment.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Robust Committee Voting, or The Other Side of Representation.
Proceedings of the 26th ACM Conference on Economics and Computation, 2025

Discrete Budget Aggregation: Truthfulness and Proportionality.
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

2024
Truthful Budget Aggregation: Beyond Moving-Phantom Mechanisms.
CoRR, 2024

Monotone Randomized Apportionment.
Proceedings of the 25th ACM Conference on Economics and Computation, 2024

Weighted Envy-Freeness for Submodular Valuations.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Project-Fair and Truthful Mechanisms for Budget Aggregation.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 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
Models and algorithms for scalable collective decision making (Modelle und Algorithmen für skalierbare kollektive Entscheidungsfindung)
PhD thesis, 2023

Removing the Barriers: Overcoming Impostor Phenomenon as a Community.
Bull. EATCS, 2023

On price-induced minmax matchings.
CoRR, 2023

Anonymous and Copy-Robust Delegations for Liquid Democracy.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Multiwinner Voting with Possibly Unavailable Candidates.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Margin of victory for tournament solutions.
Artif. Intell., 2022

The popular assignment problem: when cardinality is more important than popularity.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Justifying Groups in Multiwinner Approval Voting.
Proceedings of the Algorithmic Game Theory - 15th International Symposium, 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

The Price of Justified Representation.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Liquid Democracy with Ranked Delegations.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

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

Dueling Bandits with Team Comparisons.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Picking Sequences and Monotonicity in Weighted Fair Division.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Margin of Victory in Tournaments: Structural and Experimental Results.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Popular Branchings and Their Dual Certificates.
Proceedings of the Integer Programming and Combinatorial Optimization, 2020

Refining Tournament Solutions via Margin of Victory.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Approval-Based Apportionment.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Maintaining Perfect Matchings at Low Cost.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019


  Loading...