Markus Brill

MaRDI QIDQ250707zbMATH OpenDBLPORCIDWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Strategic voting and strategic candidacy	2024-11-13	Paper
Phragmén's voting methods and justified representation Mathematical Programming. Series A. Series B	2024-02-21	Paper
The maximin support method: an extension of the d'Hondt method to approval-based multiwinner elections Mathematical Programming. Series A. Series B	2024-02-21	Paper
Approval-based apportionment Mathematical Programming. Series A. Series B	2024-02-21	Paper
The excess method: a multiwinner approval voting procedure to allocate wasted votes Social Choice and Welfare	2022-04-13	Paper
Margin of victory for tournament solutions Artificial Intelligence	2021-12-13	Paper
Tournament solutions	2020-11-12	Paper
Extending tournament solutions Social Choice and Welfare	2018-11-07	Paper
On the tradeoff between efficiency and strategyproofness Games and Economic Behavior	2018-07-12	Paper
On the structure of stable tournament solutions Economic Theory	2018-03-29	Paper
Justified representation in approval-based committee voting Social Choice and Welfare	2017-05-23	Paper
An ordinal minimax theorem Games and Economic Behavior	2016-03-01	Paper
Possible and necessary winners of partial tournaments Journal of Artificial Intelligence Research	2016-01-07	Paper
Bypassing combinatorial protections: polynomial-time algorithms for single-peaked electorates Journal of Artificial Intelligence Research	2015-08-25	Paper
The computational complexity of random serial dictatorship Lecture Notes in Computer Science	2015-01-12	Paper
Minimal retentive sets in tournaments Social Choice and Welfare	2014-12-15	Paper
The computational complexity of random serial dictatorship Economics Letters	2014-06-06	Paper
Testing substitutability of weak preferences Mathematical Social Sciences	2014-02-11	Paper
On the complexity of iterated weak dominance in constant-sum games Theory of Computing Systems	2011-11-23	Paper
The computational complexity of weak saddles Theory of Computing Systems	2011-11-23	Paper
On the complexity of iterated weak dominance in constant-sum games Algorithmic Game Theory	2009-12-01	Paper
The computational complexity of weak saddles Algorithmic Game Theory	2009-12-01	Paper

Research outcomes over time

This page was built for person: Markus Brill