|go to week of Dec 30, 2012||30||31||1||2||3||4||5|
|go to week of Jan 6, 2013||6||7||8||9||10||11||12|
|go to week of Jan 13, 2013||13||14||15||16||17||18||19|
|go to week of Jan 20, 2013||20||21||22||23||24||25||26|
|go to week of Jan 27, 2013||27||28||29||30||31||1||2|
Algorithms for computing game-theoretic solutions are now deployed in real-world security domains, including air travel and harbors. These applications raise some hard questions. How do we deal with the equilibrium selection problem? How is the temporal and informational structure of the game best modeled? What assumptions can we reasonably make about the utility functions of the attacker and the defender? And, last but not least, can we make all these modeling decisions in a way that allows us to scale to realistic instances? I will present our ongoing work on answering these questions.