![]() |
![]() |
University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Best Response Dynamics on Random Graphs
![]() Best Response Dynamics on Random GraphsAdd 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. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsType the title of a new list here BritGrav 15 Analysis Reading SeminarOther talksExtending the Lax type operator for finite W-algebras TBC Ultrafast, all-optical, and highly efficient imaging of molecular chirality Sylow branching coefficients for symmetric groups Geometry of alternating projections in metric spaces with bounded curvature Test talk |