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.14.tar.gz
(6.7 kB
view hashes)
Built Distribution
Close
Hashes for gridvoting-0.0.14-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | eca780b1f185e0fcac63a508d0ec7adcfcf52e8ba31ed726015686c814ef2322 |
|
MD5 | d6b4c74d9d4b6c789383591f2f9a6bba |
|
BLAKE2b-256 | d1cd2f17e57e4ea951c8a116f370aff18513ad020cc243a30168148ba4a9f33c |