Counting votes in coupled decisions: An efficient method for counting votes in coupled decisions with multiple inequality restrictions

Theory and Decision 81 (2):213-253 (2016)
  Copy   BIBTEX

Abstract

We consider scenarios with distributed decision processes, e.g., coupled majorities and personal union in parliament chambers, supranational decisions and supervisory boards. When computing the adoption rate for reaching a decision in these scenarios, multiple linear inequality restrictions in combinatorial countings are present. These rates cannot be computed in closed form. We introduce a general method for incorporating multiple inequality conditions in multiple majority decisions, which significantly reduces the number of involved summations and removes restrictions on the summation indices. Exact solutions are provided through integral representations which can be evaluated numerically, and unrestricted, contracted sums over discrete events. Further, we provide methods to reduce the number of necessary summations by splitting or recurring the original problem to easier sub-problems. For five dedicated scenarios, full results are given which indeed require a single unrestricted summation only.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,612

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The many futures of a decision.Jay Lampert - 2018 - London: Bloomsbury Academic.
A model of path-dependence in decisions over multiple propositions.Christian List - 2004 - American Political Science Review 98 (3):495-513.

Analytics

Added to PP
2017-06-25

Downloads
15 (#244,896)

6 months
4 (#1,635,958)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references