Compromise, consensus, and the iteration of means
From MaRDI portal
(Redirected from Publication:1006437)
Recommendations
Cites work
Cited in
(19)- Agreement in Circular Societies
- Demystifying the `metric approach to social compromise with the unanimity criterion'
- Generalized patterns from local and non local reactions
- Krause mean processes generated by cubic stochastic matrices IV: off-diagonally uniformly positive nonautonomous cubic stochastic matrices
- Applications of quadratic stochastic operators to nonlinear consensus problems
- Mathematical models of nonlinear uniform consensus. II
- Network topology design to influence the effects of manipulative behaviors in a social choice procedure
- A `divide and choose' approach to compromising
- A model of voting dynamics under bounded confidence with nonstandard norming
- On dynamic compromise
- Krause mean processes generated by cubic stochastic diagonally primitive matrices
- Krause mean processes generated by off-diagonally uniformly positive nonautonomous stochastic hyper-matrices
- Arithmetic–geometric discrete systems
- Markov chains, Gauss soups, and compromise dynamics
- Reaching a consensus via Krause mean processes in multi-agent systems: quadratic stochastic operators
- Approaching consensus can be delicate when positions harden
- Krause Mean Processes Generated by Cubic Stochastic Matrices with Weak Influences
- scientific article; zbMATH DE number 2079342 (Why is no real title available?)
- Conciliationism and merely possible disagreement
This page was built for publication: Compromise, consensus, and the iteration of means
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006437)