𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Intersection rules for consensus n-trees

✍ Scribed by R.C. Powers

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
304 KB
Volume
8
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis

We prove a theorem that offers an axiomatic characterization of a class of generalized intersection rules for consensus n-trees. By modifying one of the axioms, there is a corresponding result for the Adams consensus rule.

πŸ“œ SIMILAR VOLUMES

Thresholded consensus for n-trees
Thresholded consensus for n-trees
✍ Jean-Pierre BarthΓ©lemy πŸ“‚ Article πŸ“… 1988 πŸ› Springer 🌐 English βš– 544 KB
On an independence condition for consens
On an independence condition for consensus n-trees
✍ Jean-Pierre Barthelemy; F.R. McMorris πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 308 KB

## Ternary independence for a consensus function is introduced and used to prove a version of Arrow's theorem' for n-trees.

Dictatorial consensus functions on n-tre
Dictatorial consensus functions on n-trees
✍ Jean-Pierre BarthΓ©lemy; F.R. McMorris; R.C. Powers πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 417 KB
Strategy-proof consensus rules for commi
Strategy-proof consensus rules for committee elections
✍ H.-H. Bock; W.H.E. Day; F.R. McMorris πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 508 KB

committee election problem is to choose from a finite set S of candidates a nonempty subset of committee members as the consequence of an election in which each voter expresses a preference for a candidate in S. We use ideas of vote concentration to formulate families of committee election rules, wh