81 citations · 388 across the 46 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2009★ 21 cited
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs
Jean Cardinal, Erik D. Demaine, Samuel Fiorini +3
The Stackelberg Minimum Spanning Tree Game is a two-level combinatorial pricing problem played on a graph representing a network. Its edges are colored either red or blue, and the…
cs.GT2007★ 31 cited
The Stackelberg Minimum Spanning Tree Game
Jean Cardinal, Erik D. Demaine, Samuel Fiorini +4
We consider a one-round two-player network pricing game, the Stackelberg Minimum Spanning Tree game or StackMST. The game is played on a graph (representing a network), whose edges…