Koller AAAI 2002

From Cohen Courses
Revision as of 20:50, 31 March 2011 by Subhodee (talk | contribs) (Created page with '== Citation == D Vickrey and D Koller. Multi-agent algorithms for solving Graphical Games 18th Ntl conference on Artificial Intelligence, AAAI Press, 2002 == Online version == […')
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

Citation

D Vickrey and D Koller. Multi-agent algorithms for solving Graphical Games 18th Ntl conference on Artificial Intelligence, AAAI Press, 2002

Online version

AAAI 2002

Summary

This paper presents a multi-agent algorithm approach to solve Graphical Games. Here they try to answer the question of network evolution of over time. While static graph models have been studied, less is known about time-evolving graphs. They use the following Patent Citation Network. They study a number of real world graphs and observe some interesting phenomena.

  • Most graphs densify over time with number of edges growing superlinearly with respect to the number of nodes
  • The average distance between nodes shrinks over time

Since existing graph generation models do not model for such behaviors they propose a new graph generation model based on a forestfire approach.

Method

They use the Forest Fire method for graph generation. The goal of this method to construct a graph that has the properties of following densification power laws, long-tailed in and out degrees and shrinking diameter.