Reaching a consensus: a discrete nonlinear time-varying case
From MaRDI portal
Publication:2822290
Recommendations
- Reaching consensus via polynomial stochastic operators: A general study
- Mathematical models of nonlinear uniform consensus. II
- scientific article; zbMATH DE number 5994918
- A discrete nonlinear and non-autonomous model of consensus formation
- Consensus in nonlinear stationary networks with identical agents
Cited in
(32)- The robustness of democratic consensus
- Ergodicity of non-homogeneous \(\mathbf{p}\)-majorizing quadratic stochastic operators
- Distribution of consensus in a broadcast-based consensus algorithm with random initial opinions
- Krause mean processes generated by cubic stochastic matrices IV: off-diagonally uniformly positive nonautonomous cubic stochastic matrices
- Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events
- Models of latent consensus
- Prevalence problem in the set of quadratic stochastic operators acting on \(L^{1}\)
- Applications of quadratic stochastic operators to nonlinear consensus problems
- Hybrid consensus for averager-copier-voter networks with non-rational agents
- Mathematical models of nonlinear uniform consensus. II
- Convergence to consensus by general averaging
- Ergodicity of $p$-majorizing nonlinear Markov operators on the finite dimensional space
- scientific article; zbMATH DE number 2222164 (Why is no real title available?)
- Ergodicity of nonlinear Markov operators on the finite dimensional space
- Reach almost sure consensus via \(L_p\)-norm group information
- On the convergence domain in the differential model of reaching a consensus
- Krause mean processes generated by cubic stochastic diagonally primitive matrices
- Krause mean processes generated by off-diagonally uniformly positive nonautonomous stochastic hyper-matrices
- Consensus for clusters of agents with cooperative and antagonistic relationships
- Probability laws of consensus in a broadcast-based consensus-forming algorithm
- Iterated means dichotomy for discrete dynamical systems
- Reaching a consensus via Krause mean processes in multi-agent systems: quadratic stochastic operators
- Convergence of the multidimensional agreement algorithm when communication fades away
- Opinion consensus with delay when the zero eigenvalue of the connection matrix is semi-simple
- Krause Mean Processes Generated by Cubic Stochastic Matrices with Weak Influences
- Discrete-Time Dynamic Consensus on the Max Value
- A nonlinear Perron-Frobenius approach for stability and consensus of discrete-time multi-agent systems
- How to decide consensus? A combinatorial necessary and sufficient condition and a proof that consensus is decidable but NP-hard
- Reach a nonlinear consensus for MAS via doubly stochastic quadratic operators
- Reaching consensus via polynomial stochastic operators: A general study
- A discrete nonlinear and non-autonomous model of consensus formation
- Ganikhodjaev's conjecture on mean ergodicity of quadratic stochastic operators
This page was built for publication: Reaching a consensus: a discrete nonlinear time-varying case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2822290)
