Time: 11am Friday, 23th March, 2012
Location: SIT 124 Boardroom
Speaker: Bin Zhou, University of Sydney
In this talk I will present some results from a recently accepted STOC paper, “Competitive Contagion in Networks” Goyal and Kearns (2012).
The paper finds game theoretic results in the field of information diffusion.
I will introduce the two step adoption model formalised in the paper, then show conditions that bound Price of Anarchy.
It can be shown that even small deviations from the conditions will allow unbounded Price of Anarchy.