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.17.tar.gz
(7.1 kB
view hashes)
Built Distribution
Close
Hashes for gridvoting-0.0.17-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 3b6c2c36524802d2b92f4b37eba38739a35e2de6f8a8e94da50e506a26151ae3 |
|
MD5 | 9dc4c0a0c4b0f784a82738225d944dcb |
|
BLAKE2b-256 | a4a5fd99ce0355de2e75aafe69c2c7f492f8382e7f9374752f77936ce479a545 |