default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarkus Brill
Person information
- affiliation: University of Warwick, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j19]Markus Brill
, Rupert Freeman, Svante Janson, Martin Lackner:
Phragmén's voting methods and justified representation. Math. Program. 203(1): 47-76 (2024)- [j18]Markus Brill, Paul Gölz, Dominik Peters, Ulrike Schmidt-Kraepelin, Kai Wilker:
Approval-based apportionment. Math. Program. 203(1): 77-105 (2024) - [j17]Luis Sánchez Fernández, Norberto Fernández García, Jesús A. Fisteus, Markus Brill:
The maximin support method: an extension of the D'Hondt method to approval-based multiwinner elections. Math. Program. 203(1): 107-134 (2024) - [c51]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 - [c50]Markus Brill, Jannik Peters:
Completing Priceable Committees: Utilitarian and Representation Guarantees for Proportional Multiwinner Voting. AAAI 2024: 9528-9536 - [c49]Aviram Imber, Jonas Israel, Markus Brill, Hadas Shachnai, Benny Kimelfeld:
Spatial Voting with Incomplete Voter Information. AAAI 2024: 9790-9797 - [c48]Manon Revel, Niclas Boehmer, Rachael Colley, Markus Brill, Piotr Faliszewski, Edith Elkind:
Selecting Representative Bodies: An Axiomatic View. AAMAS 2024: 2701-2705 - [i25]Davide Grossi, Ulrike Hahn, Michael Mäs, Andreas Nitsche, Jan Behrens, Niclas Boehmer, Markus Brill, Ulle Endriss, Umberto Grandi, Adrian Haret, Jobst Heitzig, Nicolien Janssens, Catholijn M. Jonker, Marijn A. Keijzer, Axel Kistner, Martin Lackner, Alexandra Lieben, Anna Mikhaylovskaya, Pradeep K. Murukannaiah, Carlo Proietti, Manon Revel, Élise Rouméas, Ehud Shapiro, Gogulapati Sreedurga, Björn Swierczek, Nimrod Talmon, Paolo Turrini, Zoi Terzopoulou, Frederik Van De Putte:
Enabling the Digital Democratic Revival: A Research Program for Digital Democracy. CoRR abs/2401.16863 (2024) - 2023
- [c47]Markus Brill, Stefan Forster, Martin Lackner, Jan Maly, Jannik Peters:
Proportionality in Approval-Based Participatory Budgeting. AAAI 2023: 5524-5531 - [c46]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 - [c45]Markus Brill, Evangelos Markakis, Georgios Papasotiropoulos, Jannik Peters:
Proportionality Guarantees in Elections with Interdependent Issues. IJCAI 2023: 2537-2545 - [c44]Markus Brill, Jannik Peters:
Robust and Verifiable Proportionality Axioms for Multiwinner Voting. EC 2023: 301 - [i24]Markus Brill, Jannik Peters:
Robust and Verifiable Proportionality Axioms for Multiwinner Voting. CoRR abs/2302.01989 (2023) - [i23]Markus Brill, Stefan Forster, Martin Lackner, Jan Maly, Jannik Peters:
Proportionality in Approval-Based Participatory Budgeting. CoRR abs/2302.03672 (2023) - [i22]Aviram Imber, Jonas Israel, Markus Brill, Hadas Shachnai, Benny Kimelfeld:
Finding Possible and Necessary Winners in Spatial Voting with Partial Information. CoRR abs/2302.08929 (2023) - [i21]Manon Revel, Niclas Boehmer, Rachael Colley, Markus Brill, Piotr Faliszewski, Edith Elkind:
Selecting Representative Bodies: An Axiomatic View. CoRR abs/2304.02774 (2023) - [i20]Markus Brill, Jannik Peters:
Completing Priceable Committees: Utilitarian and Representation Guarantees for Proportional Multiwinner Voting. CoRR abs/2312.08187 (2023) - [i19]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
- [j16]Markus Brill, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Margin of victory for tournament solutions. Artif. Intell. 302: 103600 (2022) - [j15]Steven J. Brams, Markus Brill, Anne-Marie George:
The excess method: a multiwinner approval voting procedure to allocate wasted votes. Soc. Choice Welf. 58(2): 283-300 (2022) - [c43]Markus Brill, Théo Delemazure, Anne-Marie George, Martin Lackner, Ulrike Schmidt-Kraepelin:
Liquid Democracy with Ranked Delegations. AAAI 2022: 4884-4891 - [c42]Markus Brill, Jonas Israel, Evi Micha, Jannik Peters:
Individual Representation in Approval-Based Committee Voting. AAAI 2022: 4892-4899 - [c41]Aviram Imber, Jonas Israel, Markus Brill, Benny Kimelfeld:
Approval-Based Committee Voting under Incomplete Information. AAAI 2022: 5076-5083 - [c40]Niclas Boehmer, Markus Brill, Ulrike Schmidt-Kraepelin:
Proportional Representation in Matching Markets: Selecting Multiple Matchings under Dichotomous Preferences. AAMAS 2022: 136-144 - [i18]Markus Brill, Jiehua Chen, Andreas Darmann, David M. Pennock, Matthias Greger:
Algorithms for Participatory Democracy (Dagstuhl Seminar 22271). Dagstuhl Reports 12(7): 1-18 (2022) - 2021
- [c39]Markus Brill, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Margin of Victory in Tournaments: Structural and Experimental Results. AAAI 2021: 5228-5235 - [c38]Luis Sánchez Fernández, Norberto Fernández García, Jesús A. Fisteus, Markus Brill:
The Maximin Support Method: An Extension of the D'Hondt Method to Approval-Based Multiwinner Elections. AAAI 2021: 5690-5697 - [c37]Jonas Israel, Markus Brill:
Dynamic Proportional Rankings. IJCAI 2021: 261-267 - [c36]Markus Brill:
From Computational Social Choice to Digital Democracy. IJCAI 2021: 4937-4939 - [i17]Niclas Boehmer, Markus Brill, Ulrike Schmidt-Kraepelin:
Selecting Matchings via Multiwinner Voting: How Structure Defeats a Large Candidate Space. CoRR abs/2102.07441 (2021) - [i16]Markus Brill, Rupert Freeman, Svante Janson, Martin Lackner:
Phragmén's Voting Methods and Justified Representation. CoRR abs/2102.12305 (2021) - [i15]Aviram Imber, Jonas Israel, Markus Brill, Benny Kimelfeld:
Committee Voting with Incomplete Approvals. CoRR abs/2103.14847 (2021) - [i14]Markus Brill, Rupert Freeman, Vincent Conitzer:
Computing Possible and Necessary Equilibrium Actions (and Bipartisan Set Winners). CoRR abs/2104.14317 (2021) - [i13]Jonas Israel, Markus Brill:
Dynamic Proportional Rankings. CoRR abs/2105.08043 (2021) - [i12]Markus Brill, Jonas Israel, Evi Micha, Jannik Peters:
Individual Representation in Approval-Based Committee Voting. CoRR abs/2112.05193 (2021) - [i11]Markus Brill, Théo Delemazure, Anne-Marie George, Martin Lackner, Ulrike Schmidt-Kraepelin:
Liquid Democracy with Ranked Delegations. CoRR abs/2112.07509 (2021) - 2020
- [c35]Markus Brill, Paul Gölz, Dominik Peters, Ulrike Schmidt-Kraepelin, Kai Wilker:
Approval-Based Apportionment. AAAI 2020: 1854-1861 - [c34]Markus Brill, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Refining Tournament Solutions via Margin of Victory. AAAI 2020: 1862-1869 - [i10]Felix Brandt, Markus Brill, Hans Georg Seedig, Warut Suksompong:
On the Structure of Stable Tournament Solutions. CoRR abs/2004.01651 (2020) - [i9]Markus Brill, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Margin of Victory in Tournaments: Structural and Experimental Results. CoRR abs/2012.02657 (2020)
2010 – 2019
- 2019
- [j14]Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz:
Exact mean computation in dynamic time warping spaces. Data Min. Knowl. Discov. 33(1): 252-291 (2019) - [c33]Markus Brill, Piotr Faliszewski, Frank Sommer, Nimrod Talmon:
Approximation Algorithms for BalancedCC Multiwinner Rules. AAMAS 2019: 494-502 - [i8]Markus Brill, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Refining Tournament Solutions via Margin of Victory. CoRR abs/1911.06289 (2019) - [i7]Markus Brill, Paul Gölz, Dominik Peters, Ulrike Schmidt-Kraepelin, Kai Wilker:
Approval-Based Apportionment. CoRR abs/1911.08365 (2019) - 2018
- [j13]Haris Aziz, Florian Brandl, Felix Brandt, Markus Brill:
On the tradeoff between efficiency and strategyproofness. Games Econ. Behav. 110: 1-18 (2018) - [j12]Felix Brandt, Markus Brill, Paul Harrenstein:
Extending tournament solutions. Soc. Choice Welf. 51(2): 193-222 (2018) - [c32]Markus Brill:
Interactive Democracy. AAMAS 2018: 1183-1187 - [c31]Markus Brill, Nimrod Talmon:
Pairwise Liquid Democracy. IJCAI 2018: 137-143 - [c30]Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz:
Exact Mean Computation in Dynamic Time Warping Spaces. SDM 2018: 540-548 - 2017
- [j11]Haris Aziz, Markus Brill, Vincent Conitzer, Edith Elkind, Rupert Freeman, Toby Walsh:
Justified representation in approval-based committee voting. Soc. Choice Welf. 48(2): 461-485 (2017) - [j10]Felix Brandt, Markus Brill:
Computing Dominance-Based Solution Concepts. ACM Trans. Economics and Comput. 5(2): 9:1-9:22 (2017) - [c29]Markus Brill, Rupert Freeman, Svante Janson, Martin Lackner:
Phragmén's Voting Methods and Justified Representation. AAAI 2017: 406-413 - [c28]Markus Brill, Jean-François Laslier, Piotr Skowron:
Multiwinner Approval Rules as Apportionment Methods. AAAI 2017: 414-420 - [c27]Piotr Skowron, Martin Lackner, Markus Brill, Dominik Peters, Edith Elkind:
Proportional Rankings. IJCAI 2017: 409-415 - [i6]Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz:
Exact Mean Computation in Dynamic Time Warping Spaces. CoRR abs/1710.08937 (2017) - 2016
- [j9]Felix Brandt, Markus Brill, Warut Suksompong:
An ordinal minimax theorem. Games Econ. Behav. 95: 107-112 (2016) - [c26]Markus Brill, Rupert Freeman, Vincent Conitzer:
Computing Possible and Necessary Equilibrium Actions (and Bipartisan Set Winners). AAAI 2016: 369-375 - [c25]Vincent Conitzer, Rupert Freeman, Markus Brill, Yuqian Li:
Rules for Choosing Societal Tradeoffs. AAAI 2016: 460-467 - [c24]Markus Brill, Vincent Conitzer, Rupert Freeman, Nisarg Shah:
False-Name-Proof Recommendations in Social Networks. AAMAS 2016: 332-340 - [c23]Markus Brill, Edith Elkind, Ulle Endriss, Umberto Grandi:
Pairwise Diffusion of Preference Rankings in Social Networks. IJCAI 2016: 130-136 - [c22]Markus Brill, Vincent Conitzer, Rupert Freeman, Nisarg Shah:
False-Name-Proof Recommendations in Social Networks. ISAIM 2016 - [c21]Markus Brill, Rupert Freeman, Vincent Conitzer:
Computing Possible and Necessary Equilibrium Actions (and Bipartisan Set Winners). ISAIM 2016 - [c20]Vincent Conitzer, Rupert Freeman, Markus Brill, Yuqian Li:
Rules for Choosing Societal Tradeoffs. ISAIM 2016 - [r1]Felix Brandt, Markus Brill, Paul Harrenstein:
Tournament Solutions. Handbook of Computational Social Choice 2016: 57-84 - [i5]Markus Brill, Jean-François Laslier, Piotr Skowron:
Multiwinner Approval Rules as Apportionment Methods. CoRR abs/1611.08691 (2016) - [i4]Piotr Skowron, Martin Lackner, Markus Brill, Dominik Peters, Edith Elkind:
Proportional Rankings. CoRR abs/1612.01434 (2016) - 2015
- [j8]Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra:
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. J. Artif. Intell. Res. 53: 439-496 (2015) - [j7]Haris Aziz, Markus Brill, Felix A. Fischer, Paul Harrenstein, Jérôme Lang, Hans Georg Seedig:
Possible and Necessary Winners of Partial Tournaments. J. Artif. Intell. Res. 54: 493-534 (2015) - [c19]Haris Aziz, Markus Brill, Vincent Conitzer, Edith Elkind, Rupert Freeman, Toby Walsh:
Justified Representation in Approval-Based Committee Voting. AAAI 2015: 784-790 - [c18]Markus Brill, Vincent Conitzer:
Strategic Voting and Strategic Candidacy. AAAI 2015: 819-826 - [c17]Vincent Conitzer, Markus Brill, Rupert Freeman:
Crowdsourcing Societal Tradeoffs. AAMAS 2015: 1213-1217 - [c16]Rupert Freeman, Markus Brill, Vincent Conitzer:
General Tiebreaking Schemes for Computational Social Choice. AAMAS 2015: 1401-1409 - 2014
- [j6]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein:
Minimal retentive sets in tournaments. Soc. Choice Welf. 42(3): 551-574 (2014) - [j5]Haris Aziz, Felix Brandt, Markus Brill, Julián Mestre:
Computational aspects of random serial dictatorship. SIGecom Exch. 13(2): 26-30 (2014) - [c15]Felix Brandt, Markus Brill, Paul Harrenstein:
Extending Tournament Solutions. AAAI 2014: 580-586 - [c14]Rupert Freeman, Markus Brill, Vincent Conitzer:
On the Axiomatic Characterization of Runoff Voting Rules. AAAI 2014: 675-681 - [c13]Felix Brandt, Markus Brill, Paul Harrenstein:
Extending Tournament Solutions. ISAIM 2014 - [i3]Felix Brandt, Markus Brill, Warut Suksompong:
An Ordinal Minimax Theorem. CoRR abs/1412.4198 (2014) - 2013
- [j4]Haris Aziz, Markus Brill, Paul Harrenstein:
Testing substitutability of weak preferences. Math. Soc. Sci. 66(1): 91-94 (2013) - [c12]Haris Aziz, Felix Brandt, Markus Brill:
On the tradeoff between economic efficiency and strategy proofness in randomized social choice. AAMAS 2013: 455-462 - [c11]Haris Aziz, Felix Brandt, Markus Brill:
The Computational Complexity of Random Serial Dictatorship. WINE 2013: 24-25 - [i2]Haris Aziz, Felix Brandt, Markus Brill:
The Computational Complexity of Random Serial Dictatorship. CoRR abs/1304.3169 (2013) - 2012
- [b1]Markus Brill:
Set-Valued Solution Concepts in Social Choice and Game Theory: Axiomatic and Computational Aspects. Technical University Munich, 2012 - [c10]Markus Brill, Felix A. Fischer:
The Price of Neutrality for the Ranked Pairs Method. AAAI 2012: 1299-1305 - [c9]Haris Aziz, Paul Harrenstein, Markus Brill, Jérôme Lang, Felix A. Fischer, Hans Georg Seedig:
Possible and necessary winners of partial tournaments. AAMAS 2012: 585-592 - [c8]Felix Brandt, Markus Brill:
Computing dominance-based solution concepts. EC 2012: 233 - [p1]Markus Brill:
Mengenwertige Lösungskonzepte in Spieltheorie und Social-Choice-Theorie. Ausgezeichnete Informatikdissertationen 2012: 41-50 - [i1]Haris Aziz, Markus Brill, Paul Harrenstein:
Testing Substitutability of Weak Preferences. CoRR abs/1201.0432 (2012) - 2011
- [j3]Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann:
The Computational Complexity of Weak Saddles. Theory Comput. Syst. 49(1): 139-161 (2011) - [j2]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein:
On the Complexity of Iterated Weak Dominance in Constant-Sum Games. Theory Comput. Syst. 49(1): 162-181 (2011) - [c7]Felix Brandt, Markus Brill, Hans Georg Seedig:
On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions. IJCAI 2011: 85-90 - [c6]Felix Brandt, Markus Brill:
Necessary and sufficient conditions for the strategyproofness of irresolute social choice functions. TARK 2011: 136-142 - 2010
- [c5]Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra:
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. AAAI 2010: 715-722 - [c4]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein:
Minimal retentive sets in tournaments. AAMAS 2010: 47-58
2000 – 2009
- 2009
- [j1]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein, Jan Hoffmann:
Computing Shapley's saddles. SIGecom Exch. 8(2): 3 (2009) - [c3]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein:
Computational aspects of Shapley's saddles. AAMAS (1) 2009: 209-216 - [c2]Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann:
The Computational Complexity of Weak Saddles. SAGT 2009: 238-249 - [c1]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein:
On the Complexity of Iterated Weak Dominance in Constant-Sum Games. SAGT 2009: 287-298
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:19 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:
