Related references
Note: Only part of the references are listed.Improved lower bound on the dimension of the EU council's voting rules
Stefan Kober et al.
OPTIMIZATION LETTERS (2021)
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
Matteo Fischetti et al.
OPERATIONS RESEARCH (2017)
Dimension of the Lisbon voting rules in the EU Council: a challenge and new world record
Sascha Kurz et al.
OPTIMIZATION LETTERS (2016)
Bilevel Knapsack with Interdiction Constraints
Alberto Caprara et al.
INFORMS JOURNAL ON COMPUTING (2016)
A STUDY ON THE COMPUTATIONAL COMPLEXITY OF THE BILEVEL KNAPSACK PROBLEM
Alberto Caprara et al.
SIAM JOURNAL ON OPTIMIZATION (2014)
A hardness result for core stability in additive hedonic games
Gerhard J. Woeginger
MATHEMATICAL SOCIAL SCIENCES (2013)
Complexity of clique coloring and related problems
Daniel Marx
THEORETICAL COMPUTER SCIENCE (2011)
Pinpointing the complexity of the interval min-max regret knapsack problem
Vladimir G. Deineko et al.
DISCRETE OPTIMIZATION (2010)
Some results on (a:b)-choosability
Shai Gutner et al.
DISCRETE MATHEMATICS (2009)
Min-max and min-max regret versions of combinatorial optimization problems: A survey
Hassene Aissi et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2009)
On core membership testing for hedonic coalition formation games
Shao Chin Sung et al.
OPERATIONS RESEARCH LETTERS (2007)
Core in a simple coalition formation game
S Banerjee et al.
SOCIAL CHOICE AND WELFARE (2001)
Share Paper
