No-Regret Learning Supports Voters' Competence

被引:0
|
作者
Spelda, Petr [1 ,3 ]
Stritecky, Vit [1 ]
Symons, John [2 ]
机构
[1] Charles Univ Prague, Inst Polit Studies, Fac Social Sci, Dept Secur Studies, Prague, Czech Republic
[2] Univ Kansas, Dept Philosophy, Lawrence, KS USA
[3] Charles Univ Prague, Inst Polit Studies, Fac Social Sci, Dept Secur Studies, U Krize 8, Prague 5, Czech Republic
关键词
Jury theorems; meta-induction; no-regret learning; epistemic democracy; EPISTEMIC DEMOCRACY; SCIENCE; DISAGREEMENT; NETWORKS; FACT;
D O I
10.1080/02691728.2023.2252763
中图分类号
N09 [自然科学史]; B [哲学、宗教];
学科分类号
01 ; 0101 ; 010108 ; 060207 ; 060305 ; 0712 ;
摘要
Procedural justifications of democracy emphasize inclusiveness and respect and by doing so come into conflict with instrumental justifications that depend on voters' competence. This conflict raises questions about jury theorems and makes their standing in democratic theory contested. We show that a type of no-regret learning called meta-induction can help to satisfy the competence assumption without excluding voters or diverse opinion leaders on an a priori basis. Meta-induction assigns weights to opinion leaders based on their past predictive performance to determine the level of their inclusion in recommendations for voters. The weighting minimizes the difference between the performance of meta-induction and the best opinion leader in hindsight. The difference represents the regret of meta-induction whose minimization ensures that the recommendations are optimal in supporting voters' competence. Meta-induction has optimal truth-tracking properties that support voters' competence even if it is targeted by mis/disinformation and should be considered a tool for supporting democracy in hyper-plurality.
引用
收藏
页码:543 / 559
页数:17
相关论文
共 50 条
  • [21] Sampling Equilibria: Fast No-Regret Learning in Structured Games
    Beaglehole, Daniel
    Hopkins, Max
    Kane, Daniel
    Liu, Sihan
    Lovett, Shachar
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 3817 - 3855
  • [22] Robustness enhancement of complex networks via No-Regret learning
    Sohn, Insoo
    ICT EXPRESS, 2019, 5 (03): : 163 - 166
  • [23] No-Regret Reinforcement Learning with Heavy-Tailed Rewards
    Zhuang, Vincent
    Sui, Yanan
    24TH INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS (AISTATS), 2021, 130
  • [24] No-Regret Learning in Collaborative Spectrum Sensing with Malicious Nodes
    Zhu, Quanyan
    Han, Zhu
    Basar, Tamer
    2010 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2010,
  • [25] No-Regret Learning with Unbounded Losses: The Case of Logarithmic Pooling
    Neyman, Eric
    Roughgarden, Tim
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [26] On the Impossibility of Convergence of Mixed Strategies with Optimal No-Regret Learning
    Muthukumar, Vidya
    Phade, Soham
    Sahai, Anant
    MATHEMATICS OF OPERATIONS RESEARCH, 2024,
  • [27] Selling to a No-Regret Buyer
    Braverman, Mark
    Mao, Jieming
    Schneider, Jon
    Weinberg, Matt
    ACM EC'18: PROCEEDINGS OF THE 2018 ACM CONFERENCE ON ECONOMICS AND COMPUTATION, 2018, : 523 - 538
  • [28] No-regret learning for repeated concave games with lossy bandits
    Liu, Wenting
    Lei, Jinlong
    Yi, Peng
    2021 60TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2021, : 936 - 941
  • [29] Near-Optimal No-Regret Learning in General Games
    Daskalakis, Constantinos
    Fishelson, Maxwell
    Golowich, Noah
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [30] No-Regret Online Reinforcement Learning with Adversarial Losses and Transitions
    Jin, Tiancheng
    Liu, Junyan
    Rouyer, Chloe
    Chang, William
    Wei, Chen-Yu
    Luo, Haipeng
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,