A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem.
Toshio NakataHiroshi ImahayashiMasafumi YamashitaPublished in: Networks (2000)
Keyphrases
- directed graph
- random walk
- distributed systems
- cooperative
- distributed environment
- maximum flow
- generative model
- game theory
- bayesian networks
- directed acyclic graph
- video games
- multi agent
- edge weights
- nash equilibrium
- computer games
- probabilistic model
- virtual world
- peer to peer
- uncertain data
- serious games
- undirected graph
- learning automata
- disjoint paths