Similar Search Results

A smallest tournament for which the Banks set and the Copeland set are disjoint

Hudry, Olivier - In: Social choice and welfare 16 (1999) 1, pp. 137-143

Persistent link: https://www.econbiz.de/10001398605

A note on "Banks winners in tournaments are difficult to recognize" by G. J.@Woeginger

Hudry, Olivier - In: Social choice and welfare 23 (2004) 1, pp. 113-114

Persistent link: https://www.econbiz.de/10002129114

On the complexity of Slater's problems

Hudry, Olivier - In: European journal of operational research : EJOR 203 (2010) 1, pp. 216-221

Persistent link: https://www.econbiz.de/10003928210

On the computation of median linear orders, of median complete preoders and of median weak orders

Hudry, Olivier - In: Mathematical social sciences 64 (2012) 1, pp. 2-10

Persistent link: https://www.econbiz.de/10009655789

Complexity results for extensions of median orders to different types of remoteness

Hudry, Olivier - In: Contributions to game theory and social choice, (pp. 111-123). 2015

Persistent link: https://www.econbiz.de/10010488173

NP-hardness results for the aggregation of linear orders into median orders

Hudry, Olivier - 2008

Persistent link: https://www.econbiz.de/10003764818

A survey on the complexity of tournament solutions

Hudry, Olivier - In: Mathematical social sciences 57 (2009) 3, pp. 292-303

Persistent link: https://www.econbiz.de/10003835402

Application of the "descent with mutations" metaheuristic to a clique partitioning problem

Hudry, Olivier - In: RAIRO / Operations research 53 (2019) 3, pp. 1083-1095

Persistent link: https://www.econbiz.de/10012113790

Some rainbow problems in graphs have complexity equivalent to satisfiability problems

Hudry, Olivier; Lobstein, Antoine - In: International Transactions in Operational Research 29 (2020) 3, pp. 1547-1572

Persistent link: https://www.econbiz.de/10012282406

A smallest tournament for which the Banks set and the Copeland set are disjoint

Hudry, Olivier - In: Social Choice and Welfare 16 (1999) 1, pp. 137-143

Given a tournament T, a Banks winner of T is the first vertex of any maximal (with respect to inclusion) transitive subtournament of T; a Copeland winner of T is a vertex with a maximum out-degree. In this paper, we show that 13 is the minimum number of vertices that a tournament must have so...

Persistent link: https://www.econbiz.de/10005369320