University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Best Response Dynamics on Random Graphs

Best Response Dynamics on Random Graphs

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact M.Jenssen.

We consider an evolving system of agents whose underlying topology of interactions is determined by a binomial random graph G(n,p). In each round, each agent will choose a binary strategy which will then be executed against each of its neighbours in a symmetric 2-players game. We consider the best response dynamics on this system: each agent synchronously updates their strategy by selecting that which maximises their total payoff, given their neighbours’ current choices. We outline two results that bound the time needed for all agents to reach a consensus.

Based on joint work with Calina Durbac and Nikolaos Fountoulakis. ————————————————————————————— Meeting ID: 949 1136 5006 Passcode: 342983

This talk is part of the Combinatorics and Probability seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.