Possible and necessary winners of partial tournaments
From MaRDI portal
(Redirected from Publication:3460381)
Recommendations
- Determining possible and necessary winners given partial orders
- Possible winner problems on partial tournaments: a parameterized study
- The possible winner problem with uncertain weights
- Possible winner problems on partial tournaments: a parameterized study
- On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard
Cited in
(14)- Extending tournament solutions
- Monotonicity-based consensus states for the monometric rationalisation of ranking rules and how they are affected by ties
- On partial sorting in restricted rounds
- Margin of victory for tournament solutions
- Possible winner problems on partial tournaments: a parameterized study
- Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity?
- The flow network method
- Partially critical tournaments
- Possible winner problems on partial tournaments: a parameterized study
- Determining possible and necessary winners given partial orders
- On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard
- A solution for abstract decision problems based on maximum flow value
- The team order problem: maximizing the probability of matching being large enough
- Winning is not the only metric: the complexity of control manipulation in knockout tournaments for a redefined goal
This page was built for publication: Possible and necessary winners of partial tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460381)