Markus Brill

According to our database1, Markus Brill authored at least 40 papers between 2009 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
On the Structure of Stable Tournament Solutions.
CoRR, 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
Exact mean computation in dynamic time warping spaces.
Data Min. Knowl. Discov., 2019

Approximation Algorithms for BalancedCC Multiwinner Rules.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018
Extending tournament solutions.
Soc. Choice Welf., 2018

On the tradeoff between efficiency and strategyproofness.
Games Econ. Behav., 2018

Pairwise Liquid Democracy.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Interactive Democracy.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017
Computing Dominance-Based Solution Concepts.
ACM Trans. Economics and Comput., 2017

Justified representation in approval-based committee voting.
Soc. Choice Welf., 2017

Proportional Rankings.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Multiwinner Approval Rules as Apportionment Methods.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Phragmén's Voting Methods and Justified Representation.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Tournament Solutions.
Proceedings of the Handbook of Computational Social Choice, 2016

An ordinal minimax theorem.
Games Econ. Behav., 2016

False-Name-Proof Recommendations in Social Networks.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

Pairwise Diffusion of Preference Rankings in Social Networks.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Rules for Choosing Societal Tradeoffs.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Computing Possible and Necessary Equilibrium Actions (and Bipartisan Set Winners).
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates.
J. Artif. Intell. Res., 2015

Possible and Necessary Winners of Partial Tournaments.
J. Artif. Intell. Res., 2015

General Tiebreaking Schemes for Computational Social Choice.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Crowdsourcing Societal Tradeoffs.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Strategic Voting and Strategic Candidacy.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Computational aspects of random serial dictatorship.
SIGecom Exch., 2014

Minimal retentive sets in tournaments.
Soc. Choice Welf., 2014

On the Axiomatic Characterization of Runoff Voting Rules.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Testing substitutability of weak preferences.
Math. Soc. Sci., 2013

The Computational Complexity of Random Serial Dictatorship.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

On the tradeoff between economic efficiency and strategy proofness in randomized social choice.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

2012
Set-Valued Solution Concepts in Social Choice and Game Theory: Axiomatic and Computational Aspects.
PhD thesis, 2012

Mengenwertige Lösungskonzepte in Spieltheorie und Social-Choice-Theorie.
Proceedings of the Ausgezeichnete Informatikdissertationen 2012, 2012

The Price of Neutrality for the Ranked Pairs Method.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
On the Complexity of Iterated Weak Dominance in Constant-Sum Games.
Theory Comput. Syst., 2011

The Computational Complexity of Weak Saddles.
Theory Comput. Syst., 2011

Necessary and sufficient conditions for the strategyproofness of irresolute social choice functions.
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), 2011

On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions.
Proceedings of the IJCAI 2011, 2011

2009
Computing Shapley's saddles.
SIGecom Exch., 2009

Computational aspects of Shapley's saddles.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009


  Loading...