The following pages link to Markus Brill (Q250707):
Displaying 21 items.
- Minimal retentive sets in tournaments (Q483107) (← links)
- On the complexity of iterated weak dominance in constant-sum games (Q647483) (← links)
- The computational complexity of weak saddles (Q647484) (← links)
- Extending tournament solutions (Q1616754) (← links)
- On the tradeoff between efficiency and strategyproofness (Q1651219) (← links)
- On the structure of stable tournament solutions (Q1707316) (← links)
- Margin of victory for tournament solutions (Q2060724) (← links)
- The excess method: a multiwinner approval voting procedure to allocate wasted votes (Q2125096) (← links)
- Justified representation in approval-based committee voting (Q2397667) (← links)
- The computational complexity of random serial dictatorship (Q2453028) (← links)
- Testing substitutability of weak preferences (Q2637415) (← links)
- Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates (Q2941740) (← links)
- Possible and Necessary Winners of Partial Tournaments (Q3460381) (← links)
- The Computational Complexity of Weak Saddles (Q3648859) (← links)
- On the Complexity of Iterated Weak Dominance in Constant-Sum Games (Q3648864) (← links)
- Tournament Solutions (Q5133006) (← links)
- An ordinal minimax theorem (Q5964692) (← links)
- Phragmén's voting methods and justified representation (Q6120935) (← links)
- The maximin support method: an extension of the d'Hondt method to approval-based multiwinner elections (Q6201928) (← links)
- Approval-based apportionment (Q6201936) (← links)
- Strategic voting and strategic candidacy (Q6637499) (← links)
