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 条
  • [11] Doubly Optimal No-Regret Learning in Monotone Games
    Cai, Yang
    Zheng, Weiqiang
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 202, 2023, 202
  • [12] No-Regret and Incentive-Compatible Online Learning
    Freeman, Rupert
    Pennock, David M.
    Podimata, Chara
    Vaughan, Jennifer Wortman
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 119, 2020, 119
  • [13] No-Regret Learning in Partially-Informed Auctions
    Guo, Wenshuo
    Jordan, Michael I.
    Vitercik, Ellen
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162, 2022,
  • [14] No-Regret Learning and Equilibrium Computation in Quantum Games
    Lin, Wayne
    Piliouras, Georgios
    Sim, Ryann
    Varvitsiotis, Antonios
    QUANTUM, 2024, 8
  • [15] No-Regret Learning for Coalitional Model Predictive Control
    Chanfreut, P.
    Maestre, J. M.
    Zhu, Q.
    Camacho, E. F.
    IFAC PAPERSONLINE, 2020, 53 (02): : 3439 - 3444
  • [16] No-regret Online Learning over Riemannian Manifolds
    Wang, Xi
    Tu, Zhipeng
    Hong, Yiguang
    Wu, Yingyi
    Shi, Guodong
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [17] No-Regret and Incentive-Compatible Online Learning
    Freeman, Rupert
    Pennock, David M.
    Podimata, Chara
    Vaughan, Jennifer Wortman
    25TH AMERICAS CONFERENCE ON INFORMATION SYSTEMS (AMCIS 2019), 2019,
  • [18] No-Regret Learning in Unknown Games with Correlated Payoffs
    Sessa, Pier Giuseppe
    Bogunovic, Ilija
    Kamgarpour, Maryam
    Krause, Andreas
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32
  • [19] No-regret boosting
    Gambin, Anna
    Szczurek, Ewa
    ADAPTIVE AND NATURAL COMPUTING ALGORITHMS, PT 1, 2007, 4431 : 422 - +
  • [20] No regrets about no-regret
    Chang, Yu-Han
    ARTIFICIAL INTELLIGENCE, 2007, 171 (07) : 434 - 439