Computational Model Library

Tiebout sorting (version 1.0.0)

Submitted by: Marco Janssen Software Framework: NetLogo Programming Language: NetLogo
voting political system

This Netlogo replication of Kollman, K., J.H. Miller and S.E. Page (1997) Political Institutions and Sorting in a Tiebout Model, American Economic Review 87(5): 977-992. The model consists of of citizens who can vote for partie and move to other jurisdictions if they expect their preferences are better served. Parties adjust their positions to increase their share in the elections.

Release Notes

Model implementation fits outcomes of original article pretty well.

Cite this Model

Marco Janssen (2019, January 24). “Tiebout sorting” (Version 1.0.0). CoMSES Computational Model Library. Retrieved from: https://www.comses.net/codebases/ab497c2b-0d2d-468a-81ed-3ebedba84f59/releases/1.0.0/

Create an Open Code Badge that links to this model more info

This model has not been reviewed by CoMSES Net and should be independently reviewed to meet the Open Code Badge guidelines.
You can use the following HTML or Markdown code to create an Open Code Badge that links to version 1.0.0 of this computational model. 

<a href="https://www.comses.net/codebases/ab497c2b-0d2d-468a-81ed-3ebedba84f59/releases/1.0.0/">
  <img height="100" src="https://www.comses.net/static/images/icons/open-code-badge.png" alt="Open Code Badge">
</a>


[![Open Code Badge](https://www.comses.net/static/images/icons/open-code-badge.png)](https://www.comses.net/codebases/ab497c2b-0d2d-468a-81ed-3ebedba84f59/releases/1.0.0/)
Contributors

Marco Janssen

DOI

No assigned DOI

Model Version

1.0.0

License

GPL-3.0

Operating System

Operating System Independent

Programming Language

NetLogo

Dependencies

None listed

Publish Date

Thursday, January 24, 2019

Last Updated

Thursday, January 24, 2019

Downloads 128
Peer Review

Unreviewed

Version Submitter First published Last modified Status
1.0.0 Marco Janssen Thu Jan 24 19:37:29 2019 Thu Jan 24 19:37:29 2019 Published

Discussion

This website uses cookies and Google Analytics to help us track user engagement and improve our site. If you'd like to know more information about what data we collect and why, please see our data privacy policy. If you continue to use this site, you consent to our use of cookies.
Accept