Spatial Voting simulations on a grid with random challengers
Project description
gridvoting
Voting simulations on a 2D grid of feasible outcomes
Helper class and functions for a Markov Chain voting model based on a series of status quos and random challenges.
This software is at a pre-release stage and not yet intended for general use.
Inputs:
- grid size in 2D -glimit <= x,y <= glimit
- utility functions for each voter for each point on the grid
- challenger strategy (zi True/False)
Outputs:
- Markov chain transition matrix
- Existence of core (absorbing) points
- Stationary distributions (no core)
- Diagnostic and distribution plots
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
gridvoting-0.9.1.tar.gz
(7.3 kB
view hashes)
Built Distribution
Close
Hashes for gridvoting-0.9.1-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 7cbcbc8b27bc26970a4401dd1cb2cd04754ea126619cfc45f85da145acbcf227 |
|
MD5 | a1b0b51c00e2869db3ba81b6481b2b29 |
|
BLAKE2b-256 | 454ac74315172fc76ec89639b422477aea39c445109fcdb5cf9d04279e596a6a |