Game dynamics and equilibrium computation in the population protocol model
From MaRDI portal
Cites work
- A course in game theory.
- A polylogarithmic gossip algorithm for plurality consensus
- A simple population protocol for fast robust approximate majority
- A time and space optimal stable population protocol solving exact majority
- Algorithmic Game Theory
- Approximate Nash equilibria in anonymous games
- Asymptotic analysis of a random walk on a hypercube with many dimensions
- Characterization of cutoff for reversible Markov chains
- Comparison Dynamics in Population Protocols
- Computation in networks of passively mobile finite-state sensors
- Convergence of the Iterated Prisoner's Dilemma Game
- Convergence speed of binary interval consensus
- Correlated Equilibrium as an Expression of Bayesian Rationality
- Ehrenfest urn models
- Evolution of extortion in iterated prisoner's dilemma games
- Evolutionary dynamics. Exploring the equations of life.
- Evolutionary Games and Population Dynamics
- Fast and exact majority in population protocols
- Fast computation by population protocols with a leader
- Fast space optimal leader election in population protocols
- From extortion to generosity, evolution in the Iterated Prisoner’s Dilemma
- Game dynamics and equilibrium computation in the population protocol model
- Game theory
- How asynchrony affects rumor spreading time
- scientific article; zbMATH DE number 3835792 (Why is no real title available?)
- scientific article; zbMATH DE number 5869530 (Why is no real title available?)
- scientific article; zbMATH DE number 7225149 (Why is no real title available?)
- scientific article; zbMATH DE number 6850453 (Why is no real title available?)
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Mean passage times for tridiagonal transition matrices and a two-parameter ehrenfest urn model
- Non-cooperative games
- On a generalization of the ehrenfest urn model
- On an urn problem of Paul and Tatiana Ehrenfest
- On minmax theorems for multiplayer games
- Optimal time and space leader election in population protocols
- Playing with population protocols
- Plurality consensus in the gossip model
- Polylogarithmic-time leader election in population protocols
- Prediction, Learning, and Games
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Programming discrete distributions with chemical reaction networks
- Random Walk and the Theory of Brownian Motion
- Settling the complexity of computing two-player Nash equilibria
- Speed faults in computation by chemical reaction networks
- Stable leader election in population protocols requires linear time
- The computational complexity of evolutionarily stable strategies
- The donation game with roles played between relatives
- The evolution of cooperation
- The mathematics of mixing things up
- Time-space trade-offs in population protocols
- Timing in chemical reaction networks
- Twenty lectures on algorithmic game theory
- Universal protocols for information dissemination using emergent signals
- Über zwei bekannte Einwände gegen das \textit{Boltzmann}sche \(H\)-Theorem.
This page was built for publication: Game dynamics and equilibrium computation in the population protocol model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6971986)
