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.8.tar.gz
(5.5 kB
view hashes)
Built Distribution
Close
Hashes for gridvoting-0.0.8-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | a1c874ad8011e1fe54fe0c7bbe814d2341a087345e85a28ff4251916c5d7967f |
|
MD5 | b2c2c0d0fa2222cccaa66cb4de8d066d |
|
BLAKE2b-256 | 2c10e9f857b00fd71354aa42de35e9e408f5a189ec2a5a86cb8f12dc47989dfd |