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.18.tar.gz
(7.1 kB
view hashes)
Built Distribution
Close
Hashes for gridvoting-0.0.18-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | edbae7020dac86b39bf02b0f9ecb22bf55d78e52bdd8a1f8b21a5afd9cc9f5d7 |
|
MD5 | 6fca9e8ff3f3d351f6b2ef9f48c7efe9 |
|
BLAKE2b-256 | 28228b3df6baa6c0b96249f785341fc9193afe5d392cdaee0e67efdb15cddbd8 |