A comparison of zero and minimal intelligence agendas in Markov Chain voting models

Paul J Brewer and Raymond Moberly

No ajfdb, OSF Preprints from Center for Open Science

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.

Date: 2021-06-23
New Economics Papers: this item is included in nep-cdm
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://osf.io/download/60d2993373c72e00d3c3bba6/

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:osf:osfxxx:ajfdb

DOI: 10.31219/osf.io/ajfdb

Access Statistics for this paper

More papers in OSF Preprints from Center for Open Science
Bibliographic data for series maintained by OSF ().