2 citations · 4 across the 7 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.GT2025
The Complexity of Stackelberg Pricing Games
Christoph Grüne, Dorothee Henke, Eva Rotenberg +1
We consider Stackelberg pricing games, which are also known as bilevel pricing problems, or combinatorial price-setting problems. This family of problems consists of games between…
cs.CC2025
The Complexity of Blocking All Solutions
Christoph Grüne, Lasse Wulf
We consider the general problem of blocking all solutions of some given combinatorial problem with only few elements. For example, the problem of destroying all maximum cliques of…