Symmetry vs. complexity in proving the MullerSatterthwaite theorem

被引:0
|
作者
Ninjbat, Uuganbaatar [1 ]
机构
[1] Stockholm Sch Econ, Dept Econ, Stockholm, Sweden
来源
ECONOMICS BULLETIN | 2012年 / 32卷 / 02期
关键词
D O I
暂无
中图分类号
F [经济];
学科分类号
02 ;
摘要
In this short note, we first provide two rather straightforward proofs for the Muller - Satterthwaite theorem in the baseline cases of 2 person 3 alternatives, and 2 person n >= 3 alternatives. We also show that it suffices to prove the result in the special case of 3 alternatives (with arbitrary N individuals) as it then can easily be extended to the general case We then prove the result in the decisive case of 3 alternatives (with arbitrary N individuals) by induction on N.
引用
收藏
页码:1434 / 1441
页数:8
相关论文
共 50 条
  • [31] Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
    Kowalski, DR
    Pelc, A
    THEORETICAL COMPUTER SCIENCE, 2005, 333 (03) : 355 - 371
  • [32] Real Complexity vs. Apparent Complexity in Modeling Social Processes
    Malita, Mihaela
    Stefan, Gheorghe
    ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY, 2013, 16 (2-3): : 131 - 143
  • [33] Probabilistic Theorem Proving
    Gogate, Vibhav
    Domingos, Pedro
    COMMUNICATIONS OF THE ACM, 2016, 59 (07) : 107 - 115
  • [34] Proving the Stone theorem
    Nakano, H
    ANNALS OF MATHEMATICS, 1944, 42 : 665 - 667
  • [35] THEOREM PROVING WITH LEMMAS
    PETERSON, GE
    JOURNAL OF THE ACM, 1976, 23 (04) : 573 - 581
  • [36] Refinement and theorem proving
    Manolios, Panagiotis
    FORMAL METHODS FOR HARDWARE VERIFICATION, 2006, 3965 : 176 - 210
  • [37] Theorem proving modulo
    Dowek, G
    Hardin, T
    Kirchner, C
    JOURNAL OF AUTOMATED REASONING, 2003, 31 (01) : 33 - 72
  • [38] Automated theorem proving
    Li, HB
    GEOMETRIC ALGEBRA WITH APPLICATIONS IN SCIENCE AND ENGINEERING, 2001, : 110 - +
  • [39] Theorem proving for verification
    Harrison, John
    COMPUTER AIDED VERIFICATION, 2008, 5123 : 11 - 18
  • [40] Constraints and theorem proving
    Ganzinger, H
    Nieuwenhuis, R
    CONSTRAINTS IN COMPUTATIONAL LOGICS: THEORY AND APPLICATIONS, 2001, 2002 : 159 - 201