default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUlrike Schmidt-Kraepelin
Person information
- affiliation: SLMath, Berkeley, USA
- affiliation (former): Universidad de Chile
- affiliation (former): TU Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Markus Brill
, Paul Gölz, Dominik Peters, Ulrike Schmidt-Kraepelin, Kai Wilker:
Approval-based apportionment. Math. Program. 203(1): 77-105 (2024)- [j6]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
The Price of Justified Representation. ACM Trans. Economics and Comput. 12(3): 11:1-11:27 (2024) - [c17]Niclas Boehmer, Markus Brill, Alfonso Cevallos, Jonas Gehrlein, Luis Sánchez Fernández, Ulrike Schmidt-Kraepelin:
Approval-Based Committee Voting in Practice: A Case Study of (over-)Representation in the Polkadot Blockchain. AAAI 2024: 9519-9527 - [c16]Rupert Freeman, Ulrike Schmidt-Kraepelin:
Project-Fair and Truthful Mechanisms for Budget Aggregation. AAAI 2024: 9704-9712 - [c15]Luisa Montanari, Ulrike Schmidt-Kraepelin, Warut Suksompong, Nicholas Teh:
Weighted Envy-Freeness for Submodular Valuations. AAAI 2024: 9865-9873 - [i19]José Correa, Paul Gölz, Ulrike Schmidt-Kraepelin, Jamie Tucker-Foltz, Victor Verdugo:
Monotone Randomized Apportionment. CoRR abs/2405.03687 (2024) - [i18]Mark de Berg, Rupert Freeman, Ulrike Schmidt-Kraepelin, Markus Utke:
Truthful Budget Aggregation: Beyond Moving-Phantom Mechanisms. CoRR abs/2405.20303 (2024) - 2023
- [b1]Ulrike Schmidt-Kraepelin:
Models and algorithms for scalable collective decision making (Modelle und Algorithmen für skalierbare kollektive Entscheidungsfindung). TU Berlin, Germany, 2023 - [j5]Ulrike Schmidt-Kraepelin:
Removing the Barriers: Overcoming Impostor Phenomenon as a Community. Bull. EATCS 141 (2023) - [j4]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Justifying groups in multiwinner approval voting. Theor. Comput. Sci. 969: 114039 (2023) - [c14]Markus Brill, Hayrullah Dindar, Jonas Israel, Jérôme Lang, Jannik Peters, Ulrike Schmidt-Kraepelin:
Multiwinner Voting with Possibly Unavailable Candidates. AAAI 2023: 5532-5539 - [c13]Markus Utke, Ulrike Schmidt-Kraepelin:
Anonymous and Copy-Robust Delegations for Liquid Democracy. NeurIPS 2023 - [i17]Christoph Dürr, Mathieu Mari, Ulrike Schmidt-Kraepelin:
On price-induced minmax matchings. CoRR abs/2302.11902 (2023) - [i16]Markus Utke, Ulrike Schmidt-Kraepelin:
Anonymous and Copy-Robust Delegations for Liquid Democracy. CoRR abs/2307.01174 (2023) - [i15]Rupert Freeman, Ulrike Schmidt-Kraepelin:
Project-Fair and Truthful Mechanisms for Budget Aggregation. CoRR abs/2309.02613 (2023) - [i14]Niclas Boehmer, Markus Brill, Alfonso Cevallos, Jonas Gehrlein, Luis Sánchez Fernández, Ulrike Schmidt-Kraepelin:
Approval-Based Committee Voting in Practice: A Case Study of (Over-)Representation in the Polkadot Blockchain. CoRR abs/2312.11408 (2023) - 2022
- [j3]Markus Brill, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Margin of victory for tournament solutions. Artif. Intell. 302: 103600 (2022) - [j2]Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
Popular branchings and their dual certificates. Math. Program. 192(1): 567-595 (2022) - [c12]Markus Brill, Théo Delemazure, Anne-Marie George, Martin Lackner, Ulrike Schmidt-Kraepelin:
Liquid Democracy with Ranked Delegations. AAAI 2022: 4884-4891 - [c11]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
The Price of Justified Representation. AAAI 2022: 4983-4990 - [c10]Niclas Boehmer, Markus Brill, Ulrike Schmidt-Kraepelin:
Proportional Representation in Matching Markets: Selecting Multiple Matchings under Dichotomous Preferences. AAMAS 2022: 136-144 - [c9]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Justifying Groups in Multiwinner Approval Voting. SAGT 2022: 472-489 - [c8]Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
The popular assignment problem: when cardinality is more important than popularity. SODA 2022: 103-123 - [i13]Luisa Montanari, Ulrike Schmidt-Kraepelin, Warut Suksompong, Nicholas Teh:
Weighted Envy-Freeness for Submodular Valuations. CoRR abs/2209.06437 (2022) - 2021
- [j1]Mithun Chakraborty, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Picking sequences and monotonicity in weighted fair division. Artif. Intell. 301: 103578 (2021) - [c7]Markus Brill, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Margin of Victory in Tournaments: Structural and Experimental Results. AAAI 2021: 5228-5235 - [c6]Mithun Chakraborty, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Picking Sequences and Monotonicity in Weighted Fair Division. IJCAI 2021: 82-88 - [c5]Lee Cohen, Ulrike Schmidt-Kraepelin, Yishay Mansour:
Dueling Bandits with Team Comparisons. NeurIPS 2021: 20633-20644 - [i12]Niclas Boehmer, Markus Brill, Ulrike Schmidt-Kraepelin:
Selecting Matchings via Multiwinner Voting: How Structure Defeats a Large Candidate Space. CoRR abs/2102.07441 (2021) - [i11]Mithun Chakraborty, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Picking Sequences and Monotonicity in Weighted Fair Division. CoRR abs/2104.14347 (2021) - [i10]Lee Cohen, Ulrike Schmidt-Kraepelin, Yishay Mansour:
Dueling Bandits with Team Comparisons. CoRR abs/2107.02738 (2021) - [i9]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Justifying Groups in Multiwinner Approval Voting. CoRR abs/2108.12949 (2021) - [i8]Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
The popular assignment problem: when cardinality is more important than popularity. CoRR abs/2110.10984 (2021) - [i7]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
The Price of Justified Representation. CoRR abs/2112.05994 (2021) - [i6]Markus Brill, Théo Delemazure, Anne-Marie George, Martin Lackner, Ulrike Schmidt-Kraepelin:
Liquid Democracy with Ranked Delegations. CoRR abs/2112.07509 (2021) - 2020
- [c4]Markus Brill, Paul Gölz, Dominik Peters, Ulrike Schmidt-Kraepelin, Kai Wilker:
Approval-Based Apportionment. AAAI 2020: 1854-1861 - [c3]Markus Brill, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Refining Tournament Solutions via Margin of Victory. AAAI 2020: 1862-1869 - [c2]Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
Popular Branchings and Their Dual Certificates. IPCO 2020: 223-237 - [i5]Markus Brill, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Margin of Victory in Tournaments: Structural and Experimental Results. CoRR abs/2012.02657 (2020)
2010 – 2019
- 2019
- [c1]Jannik Matuschke, Ulrike Schmidt-Kraepelin, José Verschae:
Maintaining Perfect Matchings at Low Cost. ICALP 2019: 82:1-82:14 - [i4]Markus Brill, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Refining Tournament Solutions via Margin of Victory. CoRR abs/1911.06289 (2019) - [i3]Markus Brill, Paul Gölz, Dominik Peters, Ulrike Schmidt-Kraepelin, Kai Wilker:
Approval-Based Apportionment. CoRR abs/1911.08365 (2019) - [i2]Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
Popular Branchings and Their Dual Certificates. CoRR abs/1912.01854 (2019) - 2018
- [i1]Jannik Matuschke, Ulrike Schmidt-Kraepelin, José Verschae:
Maintaining Perfect Matchings at Low Cost. CoRR abs/1811.10580 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
