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.
Prif Awduron: | Brandt, F, Brill, M, Harrenstein, B |
---|---|
Fformat: | Book section |
Cyhoeddwyd: |
Cambridge University Press
2016
|
Eitemau Tebyg
-
Extending tournament solutions
gan: Brandt, F, et al.
Cyhoeddwyd: (2018) -
Minimal retentive sets in tournaments
gan: Brandt, F, et al.
Cyhoeddwyd: (2013) -
On the structure of stable tournament solutions
gan: Brandt, F, et al.
Cyhoeddwyd: (2016) -
Minimal extending sets in tournaments
gan: Brandt, F, et al.
Cyhoeddwyd: (2017) -
Possible and necessary winners of partial tournaments
gan: Harrenstein, B, et al.
Cyhoeddwyd: (2016)