|
A Minimax Procedure for Electing Committees Steven J. Brams Department of Politics New York University New York, NY 10003 USA steven.brams@nyu.edu D. Marc Kilgour Department of Mathematics Wilfrid Laurier University Waterloo, Ontario N2L 3C5 CANADA mkilgour@wlu.ca M. Remzi Sanver Department of Economics Istanbul...
|
www.nyu.edu/gsas/dept/politics/faculty/brams/committee....
www.nyu.edu/gsas/dept/politics/faculty/brams/committee.pdf
|
|
|
|
Statically evaluate positions at depth d ... From then on work upwards ... Score of max nodes is the max of child nodes...
|
www.cs.st-andrews.ac.uk/~ipg/AI/Lectures/Games1/tsld011...
www.cs.st-andrews.ac.uk/~ipg/AI/Lectures/Games1/tsld011.htm
|
|
|
A new voting procedure for electing committees called the minimax procedure is described. Based on approval balloting it chooses the committee that minimizes the maximum weighted Hamming distance from the voters expressed preferences. ... A Minimax Procedure for Electing Committees Steven J. Brams Department of Politics...
|
www.allacademic.com/meta/p40038_index.html
|
|
Wald's (1950) minimax procedure is used to determine a sequential method of ..... sequential minimax procedures may also be expressed as a function of ¡u^Q ...
|
www.jstor.org/stable/2983817
|
|
[8] Ofosu, J.B., "A Minimax Procedure for Selecting the Popula- tion with the Largest (Smallest) Scale Parameter," Calcutta ...
|
www.jstor.org/stable/2285396
|
|
F. K. Hwang, A minimax Procedure on Group Testing Problems , Tamkang J. Math., Vol. 2, pp. 39 -- 44, 1971. ... F. K. Hwang, "A minimax Procedure on Group Testing Problems", Tamkang J. Math., Vol. 2, pp. 39 -- 44, 1971. Online articles have much greater impact More about CiteSeer.IST Add search form to your site...
|
citeseer.ist.psu.edu/context/2216937/0
|
|
Abstract : This paper is a follow-up to an earlier article by the authors in which they proposed a two-stage procedure with screening to select the normal population with the largest population mean when the populations have a common known variance.
|
stinet.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=h...
stinet.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=html&identifier=ADA061337
|
|
Constants to implement the procedure for various k and p* are provided, as are calculations giving the saving in expected total sample size if the two-stage procedure is used in place of the ... Descriptors : *RANKING, *MINIMAX TECHNIQUE, SAMPLING, STATISTICAL ANALYSIS, MEAN, SELECTION, NORMAL DISTRIBUTION.
|
stinet.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=h...
stinet.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=html&identifier=ADA040067
|
|
The framework of minimax sequential decision theory (minimum information approach) is used; that is, optimal rules are obtained by minimizing the maximum expected losses associated with all possible decision rules at each stage of sampling.
|
www.eric.ed.gov/ERICWebPortal/recordDetail?accno=ED4356...
www.eric.ed.gov/ERICWebPortal/recordDetail?accno=ED435690
|
|
