Skip to main content
Log in

Changing the Rules of Play

  • Published:
Topoi Aims and scope Submit manuscript

Abstract

Social processes like voting procedures, debates, etc. depend crucially on the precise rules which define them. This rule sensitivity is illustrated by two examples, in the case of preference aggregation by the parliamentary debate concerning the German capital, and in the case of judgement aggregation by the doctrinal paradox or discursive dilemma. Using social choice functions and the theory of mechanism design, one can formulate what it means for a particular set of rules to be correct under a given game-theoretic solution concept. Furthermore, it is argued that in particular methods from logic and computer science are useful to describe and reason about the rules of play in a precise manner.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • K. Arrow (1951) Social Choice and Individual Values Wiley New York

    Google Scholar 

  • E. Clarke O. Grumberg D. Peled (1999) Model Checking MIT Press Cambridge

    Google Scholar 

  • Eshuis, R.: 2002, Semantics and Verification of UML Activity Diagrams for Workflow Modelling, PhD thesis, Twente.

  • A. Gibbard (1973) ArticleTitle‘Manipulation of Voting Schemes: A General Result’ Econometrica 41 587–601 Occurrence Handle10.2307/1914083

    Article  Google Scholar 

  • C. A. R. Hoare (1969) ArticleTitle‘An Axiomatic Basis for Computer Programming’ Communications of the ACM 12 IssueID10 576–580 10.1145/363235.363259 Occurrence Handle10.1145/363235.363259

    Article  Google Scholar 

  • Jackson, M. O.: 2000, ‘Mechanism Theory’, in The Encyclopedia of Life Support Systems, Oxford: EOLSS Publishers.

  • Leininger, W.: 1993, ‘The Fatal Vote: Berlin versus Bonn’, in Finanzarchiv 50: 1–20.

  • List, C., Pettit, P.: 2002, ‘Aggregating Sets of Judgements: An Impossibility Result’, in Economics and Philosophy 18: 89–110.

  • List, C., Pettit, P.: 2004, ‘Aggregating Sets of Judgements: Two␣Impossibility Results Compared’, in Synthese 140(1–2): 207-235.

  • D. MacKenzie (2001) Mechanizing Proof : Computing, Risk, and Trust MIT Press Cambridge

    Google Scholar 

  • J. Moore (1992) ‘Implementation, Contracts, and Renegotiation in Environments with Complete Information’ J.-J. Laffont (Eds) Advances in Economic Theory – 6th World Congress Cambridge University Press Cambridge

    Google Scholar 

  • M. Osborne A. Rubinstein (1994) A Course in Game Theory MIT Press Cambridge

    Google Scholar 

  • Pauly, M., van Hees, M.: To appear, ‘Logical Constraints on Judgement Aggregation’, Journal of Philosophical Logic.

  • Pauly, M.: To appear, ‘Programming and Verifying Subgame-Perfect Mechanisms’, Journal of Logic and Computation.

  • M. A. Satterthwaite (1975) ArticleTitle‘Strategy-Proofness and Arrow’s Conditions: Existence and Correspondence Theorems for Voting Procedures and Social Welfare Functions’ Journal of Economic Theory 10 187–217 10.1016/0022-0531(75)90050-2 Occurrence Handle10.1016/0022-0531(75)90050-2

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marc Pauly.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pauly, M. Changing the Rules of Play. Topoi 24, 209–220 (2005). https://doi.org/10.1007/s11245-005-5056-2

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11245-005-5056-2

Keywords

Navigation