Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 199

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Optimal information disclosure: A linear programming approach

Open access
Kolotilin, Anton · 2018 · Theoretical Economics

Abstract

An uninformed sender designs a mechanism that discloses information about her type to a privately informed receiver, who then decides whether to act. I impose a single-crossing assumption, so that the receiver with a higher type is more willing to act. Using a linear programming approach, I characterize optimal information disclosure and provide conditions under which full and no revelation are optimal. Assuming further that the sender's utility depends only on the sender's expected type, I provide conditions under which interval revelation is optimal. Finally, I show that the expected utilities are not monotonic in the precision of the receiver's private information.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3982/te1805

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 199

Metadata

Authors
Kolotilin, A.
Venue
Theoretical Economics
Published
2018-05
Volume
13
Issue
2
Pages
607-635
ISSN
  • 1555-7561 (ISSN-L)
  • 1933-6837
OpenAlex
W2598108008
Cited by
199
References
2
FWCI
14.59
Type
journal article
Language
en
Open access
diamond

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

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.