default search action
Jannik Peters 0001
Person information
- affiliation: TU Berlin, Germany
- affiliation (former): Hasso Plattner Institute, Potsdam, Germany
Other persons with the same name
- Jannik Peters 0002
— University of Wuppertal, Germany (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Xinhang Lu, Jannik Peters, Haris Aziz, Xiaohui Bei, Warut Suksompong:
Approval-based voting with mixed goods. Soc. Choice Welf. 62(4): 643-677 (2024) - [j1]Xinhang Lu, Jannik Peters, Haris Aziz, Xiaohui Bei, Warut Suksompong:
Correction: Approval-based voting with mixed goods. Soc. Choice Welf. 62(4): 679 (2024) - [c16]Markus Brill, Jannik Peters:
Completing Priceable Committees: Utilitarian and Representation Guarantees for Proportional Multiwinner Voting. AAAI 2024: 9528-9536 - [c15]Ioannis Caragiannis, Evi Micha, Jannik Peters:
Can a Few Decide for Many? The Metric Distortion of Sortition. ICML 2024 - [i15]Ioannis Caragiannis, Evi Micha, Jannik Peters:
Can a Few Decide for Many? The Metric Distortion of Sortition. CoRR abs/2406.02400 (2024) - [i14]Michelle Döring, Jannik Peters:
Margin of Victory for Weighted Tournament Solutions. CoRR abs/2408.06873 (2024) - 2023
- [c14]Markus Brill, Stefan Forster, Martin Lackner
Proportionality in Approval-Based Participatory Budgeting. AAAI 2023: 5524-5531 - [c13]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 - [c12]Xinhang Lu, Jannik Peters, Haris Aziz, Xiaohui Bei, Warut Suksompong:
Approval-Based Voting with Mixed Goods. AAAI 2023: 5781-5788 - [c11]Michelle Döring, Jannik Peters:
Margin of Victory for Weighted Tournament Solutions. AAMAS 2023: 1716-1724 - [c10]Markus Brill, Evangelos Markakis, Georgios Papasotiropoulos, Jannik Peters:
Proportionality Guarantees in Elections with Interdependent Issues. IJCAI 2023: 2537-2545 - [c9]Tom Demeulemeester
Relaxed Core Stability for Hedonic Games with Size-Dependent Utilities. MFCS 2023: 41:1-41:14 - [c8]Markus Brill
Robust and Verifiable Proportionality Axioms for Multiwinner Voting. EC 2023: 301 - [i13]Markus Brill, Jannik Peters:
Robust and Verifiable Proportionality Axioms for Multiwinner Voting. CoRR abs/2302.01989 (2023) - [i12]Markus Brill, Stefan Forster, Martin Lackner, Jan Maly
Proportionality in Approval-Based Participatory Budgeting. CoRR abs/2302.03672 (2023) - [i11]Jannik Peters:
A Note on Rules Achieving Optimal Metric Distortion. CoRR abs/2305.08667 (2023) - [i10]Leon Kellerhals, Jannik Peters:
Proportional Fairness in Clustering: A Social Choice Perspective. CoRR abs/2310.18162 (2023) - [i9]Markus Brill, Jannik Peters:
Completing Priceable Committees: Utilitarian and Representation Guarantees for Proportional Multiwinner Voting. CoRR abs/2312.08187 (2023) - 2022
- [c7]Markus Brill, Jonas Israel, Evi Micha, Jannik Peters:
Individual Representation in Approval-Based Committee Voting. AAAI 2022: 4892-4899 - [c6]Jannik Peters:
Online Elicitation of Necessarily Optimal Matchings. AAAI 2022: 5164-5172 - [c5]Ágnes Cseh, Tobias Friedrich, Jannik Peters:
Pareto Optimal and Popular House Allocation with Lower and Upper Quotas. AAMAS 2022: 300-308 - [c4]Ágnes Cseh, Jannik Peters:
Three-Dimensional Popular Matching with Cyclic Preferences. AAMAS 2022: 309-317 - [i8]Xinhang Lu, Jannik Peters, Haris Aziz, Xiaohui Bei, Warut Suksompong:
Approval-Based Voting with Mixed Goods. CoRR abs/2211.12647 (2022) - 2021
- [c3]Julian Berger, Maximilian Böther, Vanja Doskoc, Jonathan Gadea Harder, Nicolas Klodt, Timo Kötzing, Winfried Lötzsch, Jannik Peters, Leon Schiller, Lars Seifert, Armin Wells, Simon Wietheger
Learning Languages with Decidable Hypotheses. CiE 2021: 25-37 - [c2]Wilhelm Friedemann, Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko, Jannik Peters, Daniel Stephan, Michael Vaichenker:
Efficiency and Stability in Euclidean Network Design. SPAA 2021: 232-242 - [i7]Wilhelm Friedemann, Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko, Jannik Peters, Daniel Stephan, Michael Vaichenker:
Efficiency and Stability in Euclidean Network Design. CoRR abs/2104.11618 (2021) - [i6]Ágnes Cseh, Jannik Peters:
Three-Dimensional Popular Matching with Cyclic Preferences. CoRR abs/2105.09115 (2021) - [i5]Ágnes Cseh, Tobias Friedrich, Jannik Peters:
Pareto optimal and popular house allocation with lower and upper quotas. CoRR abs/2107.03801 (2021) - [i4]Jannik Peters:
Online Elicitation of Necessarily Optimal Matchings. CoRR abs/2112.04227 (2021) - [i3]Markus Brill, Jonas Israel, Evi Micha, Jannik Peters:
Individual Representation in Approval-Based Committee Voting. CoRR abs/2112.05193 (2021) - 2020
- [i2]Julian Berger, Maximilian Böther, Vanja Doskoc, Jonathan Gadea Harder, Nicolas Klodt, Timo Kötzing, Winfried Lötzsch, Jannik Peters, Leon Schiller, Lars Seifert, Armin Wells, Simon Wietheger:
Maps for Learning Indexable Classes. CoRR abs/2010.09460 (2020) - [i1]Julian Berger, Maximilian Böther, Vanja Doskoc, Jonathan Gadea Harder, Nicolas Klodt, Timo Kötzing, Winfried Lötzsch, Jannik Peters, Leon Schiller, Lars Seifert, Armin Wells, Simon Wietheger:
Learning Languages with Decidable Hypotheses. CoRR abs/2011.09866 (2020)
2010 – 2019
- 2019
- [c1]Jannik Peters, Daniel Stephan, Isabel Amon, Hans Gawendowicz, Julius Lischeid, Lennart Salabarria, Jonas Umland, Felix Werner, Martin S. Krejca, Ralf Rothenberger, Timo Kötzing, Tobias Friedrich:
Mixed Integer Programming versus Evolutionary Computation for Optimizing a Hard Real-World Staff Assignment Problem. ICAPS 2019: 541-554
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-09 20:31 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: