@InCollection{tardos07a,
  author =	 {\'{E}va Tardos and Tom Wexler},
  title =	 {Network Formation Games and the Potential Function
                  Method},
  booktitle = 	 {Algorithmic Game Theory},
  chapter =	 19,
  publisher =	 {Cambridge},
  year =	 2007,
  crossref =	 {nisan07a},
  abstract =	 {Large computer networks such as the Internet are
                  built, operated, and used by a large number of
                  diverse and competitive entities. In light of these
                  competing forces, it is surprising how efficient
                  these networks are. An exciting challenge in the
                  area of algorithmic game theory is to understand the
                  success of these networks in game theoretic terms:
                  what principles of interaction lead selfish
                  participants to form such efficient networks? In
                  this chapter we present a number of network
                  formation games. We focus on simple games that have
                  been analyzed in terms of the efficiency loss that
                  results from selfishness. We also highlight a
                  fundamental technique used in analyzing inefficiency
                  in many games: the potential function method.},
  url = 	 {http://jmvidal.cse.sc.edu/library/tardos07a.pdf},
  cluster = 	 {16156232463145353771}
}