• Start Date: June 28, 2011
  • Event Start Time: 1:00 PM
  • Event End Time: 2:00 PM
  • Organizers: Gene Fiorini
  • Seminar Series: REU Seminar
  • Presenter(s): Aaron Jaggard - Rutgers University
  • Event Location: DIMACS Seminar room
  • Abstract: There are many environments — such as large-scale markets, social networks, and Internet protocols — in which computational agents repeatedly interact. In considering the dynamic behavior of these interactions, an important (and interesting) question is whether the system is can be guaranteed to converge to a stable state (or solution). After providing some background on game theory and its interaction with computer science, I'll discuss recent work on a couple of problems in which we find that having multiple stable states either guarantees that a system might never converge or breaks a guarantee of convergence. This work connects to classic results in distributed computing, and it has applications to game theory, circuit design, social networks, and network protocols.