Pre-print: "A comparison of zero and minimal intelligence agendas in Markov Chain voting models"

19 views
Skip to first unread message

Paul Brewer

unread,
Jun 24, 2021, 5:21:32 PM6/24/21
to Ziconference
Dear Group:

We announce a pre-print related to Zero and Minimal Intelligence.

Brewer, P. J., & Moberly, R. & Juybari, J.  (2021, June 23). A comparison of zero and minimal intelligence agendas in Markov Chain voting models. https://doi.org/10.31219/osf.io/ajfdb

also available at:   https://osf.io/ajfdb/

Abstract

Emergent behavior in repeated collective decisions of minimally intelligent agents -- who at each step in time invoke majority rule to choose between a status quo and a random challenge -- can manifest through the long-term stationary probability distributions of a Markov Chain. We use this known technique to compare two kinds of voting agendas: a zero-intelligence agenda that chooses the challenger uniformly at random, and a minimally-intelligent agenda that chooses the challenger from the union of the status quo and the set of winning challengers. We use Google Co-Lab's GPU accelerated computing environment, with code we have hosted on Github, to compute stationary distributions for some simple examples from spatial-voting and budget-allocation scenarios. We find that the voting model using the zero-intelligence agenda converges more slowly, but in some cases to better outcomes.


We are interested in improving the paper and would welcome any comments readers may have.  

Please reply to:  drpaul...@eaftc.com

You received this because you subscribe to the Ziconference  Google Group.

Paul Brewer


Reply all
Reply to author
Forward
0 new messages