On Game-Theoretic Models of Networks

Hans Leo Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov. On Game-Theoretic Models of Networks. In Peter Eades, Tadao Takaoka, editors, Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings. Volume 2223 of Lecture Notes in Computer Science, pages 550-561, Springer, 2001. [doi]

@inproceedings{BodlaenderDK01,
  title = {On Game-Theoretic Models of Networks},
  author = {Hans Leo Bodlaender and Michael J. Dinneen and Bakhadyr Khoussainov},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2223/22230550.htm},
  tags = { finite graphs, case study, meta-model, modeling, graph-rewriting, game networks, Meta-Environment, rewriting,  infinite games, process modeling, rewriting strategies},
  researchr = {https://researchr.org/publication/BodlaenderDK01},
  cites = {0},
  citedby = {0},
  pages = {550-561},
  booktitle = {Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings},
  editor = {Peter Eades and Tadao Takaoka},
  volume = {2223},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-42985-9},
}