Tournament solutions
This handbook, written by thirty-six prominent members of the computational social choice community, covers the field comprehensively. Chapters devoted to each of the field's major themes offer detailed introductions.
Main Authors: | Brandt, F, Brill, M, Harrenstein, B |
---|---|
Format: | Book section |
Published: |
Cambridge University Press
2016
|
Similar Items
-
Extending tournament solutions
by: Brandt, F, et al.
Published: (2018) -
Minimal retentive sets in tournaments
by: Brandt, F, et al.
Published: (2013) -
On the structure of stable tournament solutions
by: Brandt, F, et al.
Published: (2016) -
Minimal extending sets in tournaments
by: Brandt, F, et al.
Published: (2017) -
Possible and necessary winners of partial tournaments
by: Harrenstein, B, et al.
Published: (2016)