CoChat
Sign Up
Cited by 16Game Theory and ApplicationsGame Theory and Voting SystemsComplexity and Algorithms in Graphs

On the hardness of designing public signals

Open access
Dughmi, Shaddin·2019·Games and Economic Behavior
DOI 10.1016/j.geb.2018.08.001
Open this paper in CoChat — free account

Integrity signals

Registry

Crossref · 10.1016/j.geb.2018.08.001

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Even in simple multi-agent generalisations, the information designer's problem may be computationally intractable.

    “Even in simple multi-agent generalisations, the information designer's problem may be computationally intractable (Dughmi, 2019), leading to recent work that leverages approximate techniques such as RL (Wu et al., 2022) - including in the case of both multiple 'senders' (Hossain et al., 2024) and multiple 'receivers' (Ivanov et al., 2023).”

    From Multi-Agent Risks from Advanced AI (2025) · cites this paper as Dughmi, 2019

Cited by

Sorted by citations

Authors
Dughmi, S.
Affiliations
University of Southern California (US)
Corresponding author
Dughmi, Shaddin
ORCID
Dughmi, Shaddin
Venue
Games and Economic Behavior
Publisher
Elsevier BV
Published
2019-11
Volume
118
Pages
609-625
ISSN
0899-8256 (ISSN-L)
DOI
10.1016/j.geb.2018.08.001
OpenAlex
W2886157879
Cited by
16
References
0
Citations by year
2026: 1 · 2025: 2 · 2024: 2 · 2023: 2 · 2021: 2 · 2020: 4 · 2019: 3
FWCI
1.70
Type
journal article
Language
en
Open access
Licence
Locations
  • Games and Economic Behavior (acceptedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
Funders
NSF (CCF-1350900)
Topics
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Game Theory and Applications
  • Social Sciences › Economics, Econometrics and Finance › Economics and Econometrics › Game Theory and Voting Systems
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
Keywords
public signals, computational complexity, hardness of approximation, planted clique, Erdős-Rényi random graphs, incomplete information, multiplayer games, equilibrium payoffs

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review