Pith. sign in

REVIEW 1 cited by

Cooperative AI via Decentralized Commitment Devices

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 2311.07815 v1 pith:4WQR7YZ4 submitted 2023-11-14 cs.AI cs.CRcs.GTcs.MA

classification cs.AIcs.CRcs.GTcs.MA
keywords commitmentcooperativecoordinationdecentralizeddevicesabilitybeenhowever
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Credible commitment devices have been a popular approach for robust multi-agent coordination. However, existing commitment mechanisms face limitations like privacy, integrity, and susceptibility to mediator or user strategic behavior. It is unclear if the cooperative AI techniques we study are robust to real-world incentives and attack vectors. However, decentralized commitment devices that utilize cryptography have been deployed in the wild, and numerous studies have shown their ability to coordinate algorithmic agents facing adversarial opponents with significant economic incentives, currently in the order of several million to billions of dollars. In this paper, we use examples in the decentralization and, in particular, Maximal Extractable Value (MEV) (arXiv:1904.05234) literature to illustrate the potential security issues in cooperative AI. We call for expanded research into decentralized commitments to advance cooperative AI capabilities for secure coordination in open environments and empirical testing frameworks to evaluate multi-agent coordination ability given real-world commitment constraints.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Non-coercive extortion in game theory

    cs.GT 2025-07 conditional novelty 5.0 of 10

    An agent can profit by committing to give a co-player an outcome-contingent reward that worsens a target player's equilibrium, and win-win 2x2 games are the most vulnerable.

Pith tools