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.
Autors principals: | Brandt, F, Brill, M, Harrenstein, B |
---|---|
Format: | Book section |
Publicat: |
Cambridge University Press
2016
|
Ítems similars
-
Extending tournament solutions
per: Brandt, F, et al.
Publicat: (2018) -
Minimal retentive sets in tournaments
per: Brandt, F, et al.
Publicat: (2013) -
On the structure of stable tournament solutions
per: Brandt, F, et al.
Publicat: (2016) -
Minimal extending sets in tournaments
per: Brandt, F, et al.
Publicat: (2017) -
Possible and necessary winners of partial tournaments
per: Harrenstein, B, et al.
Publicat: (2016)