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 条
  • [41] No-Regret Learning in Bilateral Trade via Global Budget Balance
    Bernasconi, Martino
    Castiglioni, Matteo
    Celli, Andrea
    Fusco, Federico
    PROCEEDINGS OF THE 56TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2024, 2024, : 247 - 258
  • [42] On the Convergence of No-Regret Learning Dynamics in Time-Varying Games
    Anagnostides, Ioannis
    Panageas, Ioannis
    Farina, Gabriele
    Sandholm, Tuomas
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [43] No-Regret Distributed Learning in Subnetwork Zero-Sum Games
    Huang, Shijie
    Lei, Jinlong
    Hong, Yiguang
    Shanbhag, Uday V.
    Chen, Jie
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2024, 69 (10) : 6620 - 6635
  • [44] No-Regret Learning from Partially Observed Data in Repeated Auctions
    Karaca, Orcun
    Sessa, Pier Giuseppe
    Leidi, Anna
    Kamgarpour, Maryam
    IFAC PAPERSONLINE, 2020, 53 (02): : 14 - 19
  • [45] No-Regret Learning Dynamics for Extensive-Form Correlated Equilibrium
    Celli, Andrea
    Marchesi, Alberto
    Farina, Gabriele
    Gatti, Nicola
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
  • [46] Distributed No-Regret Learning in Aggregative Games With Residual Bandit Feedback
    Liu, Wenting
    Yi, Peng
    IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2024, 11 (04): : 1734 - 1745
  • [47] No-regret algorithms in on-line learning, games and convex optimization
    Sylvain Sorin
    Mathematical Programming, 2024, 203 : 645 - 686
  • [48] Learning to bid in forward electricity markets using a no-regret algorithm
    Abate, Arega Getaneh
    Majdi, Dorsa
    Kazempour, Jalal
    Kamgarpour, Maryam
    ELECTRIC POWER SYSTEMS RESEARCH, 2024, 234
  • [49] Playing against no-regret players
    D'Andrea, Maurizio
    OPERATIONS RESEARCH LETTERS, 2023, 51 (02) : 142 - 145
  • [50] A wide range no-regret theorem
    Lehrer, E
    GAMES AND ECONOMIC BEHAVIOR, 2003, 42 (01) : 101 - 115