you're reading...

SACT Talk: The Price of Anarchy of Competitive Contagions in a Network

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.



No comments yet.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

Enter your email address to subscribe to receive notifications of new announcements by email.

Join 68 other followers

%d bloggers like this: