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.2.tar.gz
(5.1 kB
view hashes)
Built Distribution
Close
Hashes for gridvoting-0.0.2-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 1ea25cca7f8c08d71c6c335a8552e513cd4feef805466760d043f444e29573d3 |
|
MD5 | fadcbb02c1b1db9e10a29d052c91f18e |
|
BLAKE2b-256 | ddce037b263f458ec40530173fd4c6912c42da81603e9cd8f9850687978f29e5 |