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.0.12.tar.gz
(6.2 kB
view hashes)
Built Distribution
Close
Hashes for gridvoting-0.0.12-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 01f8e943f7de862765b65be158968ac06155faaa2ed6e5a6a5199ca0b1e23b8b |
|
MD5 | 58a21207ca22880275f6959e814555c4 |
|
BLAKE2b-256 | 9e8a1957f85c47f3e52a3412d17288e974252c6a0d6f1917484b0aef22dc04ad |