Pages that link to "Item:Q1906123"
From MaRDI portal
The following pages link to The fundamental theorem of voting schemes (Q1906123):
Displaying 18 items.
- Bertrand's ballot theorem (Q502696) (← links)
- A solution method to the problem proposed by Wang in voting systems (Q950080) (← links)
- Fundamentals of simple games from a viewpoint of blockability relations (Q1021485) (← links)
- Regular simple games (Q1123143) (← links)
- The theory of compositionals (Q1313850) (← links)
- On some generalizations of a mean voter theorem (Q1316994) (← links)
- Compositional calculus (Q1318365) (← links)
- Voting fairly: Transitive maximal intersecting families of sets (Q1584664) (← links)
- Ballot theorems revisited (Q1903181) (← links)
- A new proof of Monjardet's median theorem (Q1906124) (← links)
- From logical gates synthesis to chromatic bicritical clutters (Q1961457) (← links)
- Minimum self-dual decompositions of positive dual-minor Boolean functions (Q1961458) (← links)
- Lexicographic composition of simple games (Q2427133) (← links)
- Unifying voting theory from Nakamura's to Greenberg's theorems (Q2453823) (← links)
- (Q3613096) (← links)
- (Q4353158) (← links)
- The Power of Two Choices in Distributed Voting (Q5167858) (← links)
- The bounds of votes of divisor electoral methods (Q6069475) (← links)