Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

On the complexity of schedule control problems for knockout tournaments

15 references·2 citing·38 second hop

FromToDepth

this work references cited by second hop

References

1982Toward a Theory of the Rent-Seeking Society2,613 cited
1979Market Structure and Innovation1,202 cited
1985Prizes and Incentives in Elimination Tournaments1,137 cited
1989The computational difficulty of manipulating an election530 cited
1992How hard is it to control an election?391 cited
1997Tournament Solutions and Majority Voting387 cited
2007When are elections with few candidates hard to manipulate?348 cited
2007Anyone but him: The complexity of precluding an alternative249 cited
2002Chapter 4 Voting procedures230 cited
2007Junta Distributions and the Average-Case Complexity of Manipulating Elections148 cited
2000A Problem with Referendums139 cited
2005Hybrid Voting Protocols and Hardness of Manipulation99 cited
2000What Is the Correct Way to Seed a Knockout Tournament?77 cited
2007Winner determination in sequential majority voting75 cited
1985Comparing Draws for Single Elimination Tournaments73 cited

Cited by

2011Winner determination in voting trees with incomplete preferences and weighted votes

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

48 cited

2015Possible and Necessary Winners of Partial Tournaments47 cited