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
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.3.tar.gz
(7.4 kB
view hashes)
Built Distribution
Close
Hashes for gridvoting-0.9.3-py3-none-any.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 691ecaa7c1069ab20c573690e44cc841ffbb1e3c41aabb5725c304d705e57b5f |
|
| MD5 | 3d954b5ac507125827f29be98141fb87 |
|
| BLAKE2b-256 | 5019f09737593aab76235318f207b08b8b9dc09683a1cccc0155949cfedf70c5 |
