Compromise, consensus, and the iteration of means

DOI10.4171/EM/109zbMATH Open1165.91011MaRDI QIDQ1006437FDOQ1006437

Authors: 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

Recommendations

• On dynamic compromise
• Convergence to consensus by general averaging
• Arithmetic–geometric discrete systems
• On compromise schemes in dynamic models of conflicting situations
• Bifurcations and patterns in compromise processes

zbMATH Keywords

LearningBargaining AlgorithmCompromise

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Stability of multiagent systems with time-dependent communication links
• Non-negative matrices and Markov chains.
• Opinion dynamics driven by various ways of averaging
• A generalization of the Gauss limit for iterated means

Cited In (19)

• Agreement in Circular Societies
• Krause mean processes generated by cubic stochastic matrices IV: off-diagonally uniformly positive nonautonomous cubic stochastic matrices
• Generalized patterns from local and non local reactions
• Demystifying the `metric approach to social compromise with the unanimity criterion'
• 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
• Krause mean processes generated by cubic stochastic diagonally primitive matrices
• Krause mean processes generated by off-diagonally uniformly positive nonautonomous stochastic hyper-matrices
• On dynamic compromise
• 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
• Krause Mean Processes Generated by Cubic Stochastic Matrices with Weak Influences
• Approaching consensus can be delicate when positions harden
• Title not available (Why is that?)
• 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)