Compromise, consensus, and the iteration of means

DOI10.4171/EM/109zbMath1165.91011MaRDI QIDQ1006437

Ulrich Krause

Publication date: 24 March 2009

Published in: Elemente der Mathematik (Search for Journal in Brave)

Full work available at URL: http://www.ems-ph.org/journals/show_pdf.php?issn=0013-6018&vol=64&iss=1&rank=1

zbMATH Keywords

LearningBargaining AlgorithmCompromise

Mathematics Subject Classification ID

Voting theory (91B12) Auctions, bargaining, bidding and selling, and other market models (91B26) Dynamical systems in optimization and economics (37N40)

Related Items (9)

Generalized patterns from local and non local reactions ⋮ Network topology design to influence the effects of manipulative behaviors in a social choice procedure ⋮ Mathematical Models of Nonlinear Uniform Consensus II ⋮ Krause mean processes generated by cubic stochastic diagonally primitive matrices ⋮ 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 ⋮ Markov chains, Gauss soups, and compromise dynamics ⋮ Reaching a consensus via Krause mean processes in multi-agent systems: quadratic stochastic operators ⋮ A model of voting dynamics under bounded confidence with nonstandard norming

Cites Work

• Unnamed Item
• Opinion dynamics driven by various ways of averaging
• Non-negative matrices and Markov chains.
• A generalization of the Gauss limit for iterated means
• Stability of multiagent systems with time-dependent communication links

This page was built for publication: Compromise, consensus, and the iteration of means