A law of large numbers for weighted majority
暂无分享,去创建一个
[1] Elchanan Mossel. Reconstruction on Trees: Beating the Second Eigenvalue , 2001 .
[2] and C.L. Coates Lewis,et al. Threshold Logic , 1967 .
[3] A. Roth. The Shapley value , 2005, Game Theory.
[4] Y. Peres. Probability on Trees: An Introductory Climb , 1999 .
[5] H. Young. Condorcet's Theory of Voting , 1988, American Political Science Review.
[6] T. Liggett. Interacting Particle Systems , 1985 .
[7] Jonathan N. Katz,et al. The Mathematics and Statistics of Voting Power , 2002 .
[8] Yuval Peres,et al. Glauber dynamics on trees and hyperbolic graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[9] G. Owen. Multilinear Extensions of Games , 1972 .
[10] Elchanan Mossel,et al. Glauber dynamics on trees and hyperbolic graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[11] Hans-Otto Georgii,et al. Gibbs Measures and Phase Transitions , 1988 .
[12] Elchanan Mossel,et al. Recursive reconstruction on periodic trees , 1998, Random Struct. Algorithms.
[13] Alon Orlitsky,et al. A geometric approach to threshold circuit complexity , 1991, COLT '91.
[14] Paul R. Milgrom,et al. A theory of auctions and competitive bidding , 1982 .