MinMax algorithms for stabilizing consensus (Q1981802)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	MinMax algorithms for stabilizing consensus	scientific article

Statements

scholarly article

0 references

MinMax algorithms for stabilizing consensus (English)

0 references

Bernadette Charron-Bost

0 references

0 references

Distributed Computing

0 references

publication date

6 September 2021

0 references

full work available at URL

https://arxiv.org/abs/1906.09073

0 references

MaRDI profile type

MaRDI publication profile

0 references

Defining liveness

0 references

Stabilizing Consensus with Many Opinions

0 references

0 references

Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach

0 references

Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms

0 references

The Firing Squad Problem Revisited.

0 references

The Heard-Of model: computing in distributed systems with benign faults

0 references

A characterization of oblivious message adversaries for which consensus is solvable

0 references

Coordination of groups of mobile autonomous agents using nearest neighbor rules

0 references

Convergence to Consensus by General Averaging

0 references

Closed schedulers: a novel technique for analyzing asynchronous protocols

0 references

0 references

Stability of multiagent systems with time-dependent communication links

0 references

Consensus and Cooperation in Networked Multi-Agent Systems

0 references

Convergence Speed in Distributed Consensus and Averaging

0 references

Time is not a healer

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1007/S00446-021-00392-9

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1981802

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1981802&oldid=38814843"