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.0.tar.gz
(7.3 kB
view hashes)
Built Distribution
Close
Hashes for gridvoting-0.9.0-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 7a40ba57380474be5e4d91a2d1521918a77fb2411617584263e37bbea9ff1091 |
|
MD5 | 954f3e055b99406364d62ec9f633f50e |
|
BLAKE2b-256 | 87a4503c570cc31a6ef51ed574e2173181f75a07ac386d05da6b73cdacb219e3 |