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 条
  • [1] The Complexity of Proving the Discrete Jordan Curve Theorem
    Phuong Nguyen
    Cook, Stephen
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2012, 13 (01)
  • [2] The Complexity of Theorem Proving in Circumscription and Minimal Entailment
    Beyersdorff, Olaf
    Chew, Leroy
    AUTOMATED REASONING, IJCAR 2014, 2014, 8562 : 403 - 417
  • [3] The complexity of proving the discrete Jordan Curve Theorem
    Nguyen, Phuong
    Cook, Stephen
    22ND ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2007, : 245 - +
  • [4] Ramsey vs. Lexicographic Termination Proving
    Cook, Byron
    See, Abigail
    Zuleger, Florian
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, TACAS 2013, 2013, 7795 : 47 - 61
  • [5] Complexity vs. diversity
    Pronger, Greg
    SCIENTIST, 2009, 23 (03): : 16 - 16
  • [6] Complexity vs. demagogy
    不详
    OIL & GAS JOURNAL, 2011, 109 (13) : 24 - 24
  • [7] Space complexity vs. query complexity
    Lachish, Oded
    Newman, Ilan
    Shapira, Asaf
    COMPUTATIONAL COMPLEXITY, 2008, 17 (01) : 70 - 93
  • [8] Space complexity vs. query complexity
    Lachish, Oded
    Newman, Ilan
    Shapira, Asaf
    APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2006, 4110 : 426 - 437
  • [9] Learning complexity vs. communication complexity
    Linial, Nati
    Shraibman, Adi
    TWENTY-THIRD ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2008, : 53 - 63
  • [10] Space Complexity Vs. Query Complexity
    Oded Lachish
    Ilan Newman
    Asaf Shapira
    computational complexity, 2008, 17 : 70 - 93