Paper by Erik D. Demaine

Reference:

Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, and Oren Weimann, “The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs”, in Proceedings of the 5th Workshop on Internet & Network Economics (WINE 2009), Lecture Notes in Computer Science, volume 5929, Rome, Italy, December 14–18, 2009, pages 125–136.

BibTeX

@InProceedings{StackMST_WINE2009,
  AUTHOR        = {Jean Cardinal and Erik D. Demaine and Samuel Fiorini and
                   Gwena\"el Joret and Ilan Newman and Oren Weimann},
  TITLE         = {The Stackelberg Minimum Spanning Tree Game on Planar and
                   Bounded-Treewidth Graphs},
  BOOKTITLE     = {Proceedings of the 5th Workshop on Internet \& Network
                   Economics (WINE 2009)},
  bookurl       = {http://www.dis.uniroma1.it/~wine09/index.php},
  SERIES        = {Lecture Notes in Computer Science},
  seriesurl     = {http://www.springer.de/comp/lncs/},
  VOLUME        = 5929,
  ADDRESS       = {Rome, Italy},
  MONTH         = {December 14--18},
  YEAR          = 2009,
  PAGES         = {125--136},

  length        = {15 pages},
  papers        = {StackMST_JOCO; StackMST_Algorithmica},
  doi           = {https://dx.doi.org/10.1007/978-3-642-10841-9_13},
  dblp          = {https://dblp.org/rec/conf/wine/CardinalDFJNW09},
  comments      = {This paper is also available as
                   <A HREF="http://arXiv.org/abs/0906.3221">arXiv:0906.3221</A>
                   and from <A HREF="http://dx.doi.org/10.1007/978-3-642-10841-9_13">SpringerLink</A>.}
}

Comments:

This paper is also available as arXiv:0906.3221 and from SpringerLink.

Length:

The paper is 15 pages.

Availability:

The paper is available in PDF (242k).

See information on file formats.

[Google Scholar search]

Related papers:

StackMST_JOCO (The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs)

StackMST_Algorithmica (The Stackelberg Minimum Spanning Tree Game)