[图书][B] New models for population protocols

O Michail, I Chatzigiannakis, PG Spirakis - 2010 - books.google.com
Wireless sensor networks are about to be part of everyday life. Homes and workplaces
capable of self-controlling and adapting air-conditioning for different temperature and …

A survey of size counting in population protocols

D Doty, M Eftekhari - Theoretical Computer Science, 2021 - Elsevier
The population protocol model describes a network of n anonymous agents who cannot
control with whom they interact. The agents collectively solve a computational problem …

Game Dynamics and Equilibrium Computation in the Population Protocol Model

D Alistarh, K Chatterjee, M Karrabi… - Proceedings of the 43rd …, 2024 - dl.acm.org
We initiate the study of game dynamics in the population protocol model: n agents each
maintain a current local strategy and interact in pairs uniformly at random. Upon each …

A game theoretic model of wealth distribution

JP Pinasco, M Rodriguez Cartabia… - Dynamic Games and …, 2018 - Springer
In this work, we consider an agent-based model in order to study the wealth distribution
problem where the interchange is determined with a symmetric zero-sum game …

Elementarily computable functions over the real numbers and R-sub-recursive functions

O Bournez, E Hainry - Theoretical Computer Science, 2005 - Elsevier
We present an analog and machine-independent algebraic characterization of elementarily
computable functions over the real numbers in the sense of recursive analysis: we prove that …

Repeated Game Dynamics in Population Protocols

D Alistarh, K Chatterjee, M Karrabi… - arxiv preprint arxiv …, 2023 - arxiv.org
We initiate the study of repeated game dynamics in the population model, in which we are
given a population of $ n $ nodes, each with its local strategy, which interact uniformly at …

[PDF][PDF] Population Protocols that Correspond to Symmetric Games.

O Bournez, J Chalopin, J Cohen… - Int. J. Unconv …, 2013 - pageperso.lis-lab.fr
The population protocol model of Angluin et al.[3] describes a population of anonymous
finite-state agents that interact in pairs according to a transition function. The agents are …

Computing with large populations using interactions

O Bournez, P Fraigniaud, X Koegler - International Symposium on …, 2012 - Springer
We define a general model capturing the behavior of a population of anonymous agents that
interact in pairs. This model captures some of the main features of opportunistic networks, in …

Advances in Multi-Agent Learning and Private Statistical Estimation

J Lazarsfeld - 2024 - search.proquest.com
Modern machine learning systems and other data science settings are increasingly subject
to various reliability constraints: these systems may bedecentralized and involve multiple …

Space-optimal naming in population protocols

J Burman, J Beauquier, D Sohier - 33rd International Symposium on …, 2019 - hal.science
The distributed naming problem, assigning unique names to the nodes in a distributed
system, is a fundamental task. This problem is nontrivial, especially when the amount of …