Pith. sign in

REVIEW 1 cited by

AI-Enhanced Deliberative Democracy and the Future of the Collective Will

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2503.05830 v2 pith:RQHHMNGP submitted 2025-03-06 cs.CY cs.AI

AI-Enhanced Deliberative Democracy and the Future of the Collective Will

classification cs.CY cs.AI
keywords collectivefosteringfuturepreferenceswillacrossagreement-seekingai-assisted
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This article unpacks the design choices behind longstanding and newly proposed computational frameworks aimed at finding common grounds across collective preferences and examines their potential future impacts, both technically and normatively. It begins by situating AI-assisted preference elicitation within the historical role of opinion polls, emphasizing that preferences are shaped by the decision-making context and are seldom objectively captured. With that caveat in mind, we explore AI-based democratic innovations as discovery tools for fostering reasonable representations of a collective will, sense-making, and agreement-seeking. At the same time, we caution against dangerously misguided uses, such as enabling binding decisions, fostering gradual disempowerment or post-rationalizing political outcomes.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Snowveil: A Framework for Decentralised Preference Discovery

    cs.GT 2025-12 reject novelty 6.0

    Snowveil is a gossip-based decentralized preference aggregation protocol claiming almost-sure finite-time convergence and O(n) expected convergence time using a Borda-plurality rule.