๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A minimax procedure for electing committees

โœ Scribed by Steven J. Brams; D. Marc Kilgour; M. Remzi Sanver

Publisher
Springer US
Year
2007
Tongue
English
Weight
374 KB
Volume
132
Category
Article
ISSN
0048-5829

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

The *-minimax search procedure for trees
The *-minimax search procedure for trees containing chance nodes
โœ Bruce W. Ballard ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1001 KB

An extention of the alpha-beta tree priming strategy to game trees with "probability" nodes, whose values are defined as the (possibly weighted) average of their successors' values, is developed. These '\*-minhnax' trees pertain to games involving chance but no concealed infornzation. Based upon our