Minimal extending sets in tournaments
Tournament solutions play an important role within social choice theory and the mathematical social sciences at large. In 2011, Brandt proposed a new tournament solution called the minimal extending set (ME) and an associated graph-theoretic conjecture. If the conjecture had been true, ME would have...
Main Authors: | Brandt, F, Harrenstein, P, Seedig, H |
---|---|
פורמט: | Journal article |
יצא לאור: |
Elsevier
2017
|
פריטים דומים
-
Minimal retentive sets in tournaments
מאת: Brandt, F, et al.
יצא לאור: (2013) -
Extending tournament solutions
מאת: Brandt, F, et al.
יצא לאור: (2018) -
On the structure of stable tournament solutions
מאת: Brandt, F, et al.
יצא לאור: (2016) -
Tournament solutions
מאת: Brandt, F, et al.
יצא לאור: (2016) -
Possible and necessary winners of partial tournaments
מאת: Harrenstein, B, et al.
יצא לאור: (2016)