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.2.tar.gz
(7.4 kB
view hashes)
Built Distribution
Close
Hashes for gridvoting-0.9.2-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | d07679bfb2dabe1196ef69831b7cf4dd593d4608b1cea7f53eb7deca28ef8d56 |
|
MD5 | 7bd86e02b82cde89de4b775593b3cf58 |
|
BLAKE2b-256 | 8ed0b6c1da968074335f36c5265a06a7c097ae9061c8fd3d5b50ff3cc04da265 |