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 条
  • [31] Generative Hybrid Representations for Activity Forecasting with No-Regret Learning
    Guan, Jiaqi
    Yuan, Ye
    Kitani, Kris M.
    Rhinehart, Nicholas
    2020 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2020, : 170 - 179
  • [32] No-Regret Learning and Mixed Nash Equilibria: They Do Not Mix
    Flokas, Lampros
    Vlatakis-Gkaragkounis, Emmanouil V.
    Lianeas, Thanasis
    Mertikopoulos, Panayotis
    Piliouras, Georgios
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
  • [33] Tighter Robust Upper Bounds for Options via No-Regret Learning
    Xue, Shan
    Du, Ye
    Xu, Liang
    THIRTY-SEVENTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 37 NO 4, 2023, : 5348 - 5356
  • [34] Optimal No-Regret Learning in Repeated First-Price Auctions
    Han, Yanjun
    Weissman, Tsachy
    Zhou, Zhengyuan
    OPERATIONS RESEARCH, 2025, 73 (01)
  • [35] NO-REGRET NON-CONVEX ONLINE META-LEARNING
    Zhuang, Zhenxun
    Wang, Yunlong
    Yu, Kezi
    Lu, Songtao
    2020 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2020, : 3942 - 3946
  • [36] No-Regret Learning for Stackelberg Equilibrium Computation in Newsvendor Pricing Games
    Liu, Larkin
    Rong, Yuming
    ALGORITHMIC DECISION THEORY, ADT 2024, 2025, 15248 : 297 - 297
  • [37] Liquid Welfare Guarantees for No-Regret Learning in Sequential Budgeted Auctions
    Fikioris, Giannis
    Tardos, Eva
    MATHEMATICS OF OPERATIONS RESEARCH, 2024,
  • [38] Risk-Averse No-Regret Learning in Online Convex Games
    Wang, Zifan
    Shen, Yi
    Zavlanos, Michael M.
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162, 2022,
  • [39] Distributed No-Regret Learning for Stochastic Aggregative Games over Networks
    Lei, Jinlong
    Yi, Peng
    Li, Li
    2021 PROCEEDINGS OF THE 40TH CHINESE CONTROL CONFERENCE (CCC), 2021, : 7512 - 7519
  • [40] No-regret algorithms in on-line learning, games and convex optimization
    Sorin, Sylvain
    MATHEMATICAL PROGRAMMING, 2024, 203 (1-2) : 645 - 686