IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v71y2023i6p2175-2195.html
   My bibliography  Save this article

From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation

Author

Listed:
  • Eric Neyman

    (Computer Science, Columbia University, New York, New York 10027)

  • Tim Roughgarden

    (Computer Science, Columbia University, New York, New York 10027)

Abstract

This paper forges a strong connection between two seemingly unrelated forecasting problems: incentive-compatible forecast elicitation and forecast aggregation. Proper scoring rules are the well-known solution to the former problem. To each such rule s , we associate a corresponding method of aggregation, mapping expert forecasts and expert weights to a “consensus forecast,” which we call quasi-arithmetic (QA) pooling with respect to s . We justify this correspondence in several ways: QA pooling with respect to the two most well-studied scoring rules (quadratic and logarithmic) corresponds to the two most well-studied forecast aggregation methods (linear and logarithmic); given a scoring rule s used for payment, a forecaster agent who subcontracts several experts, paying them in proportion to their weights, is best off aggregating the experts’ reports using QA pooling with respect to s , meaning this strategy maximizes its worst-case profit (over the possible outcomes); the score of an aggregator who uses QA pooling is concave in the experts’ weights (as a consequence, online gradient descent can be used to learn appropriate expert weights from repeated experiments with low regret); and the class of all QA pooling methods is characterized by a natural set of axioms (generalizing classical work by Kolmogorov on quasi-arithmetic means).

Suggested Citation

  • Eric Neyman & Tim Roughgarden, 2023. "From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation," Operations Research, INFORMS, vol. 71(6), pages 2175-2195, November.
  • Handle: RePEc:inm:oropre:v:71:y:2023:i:6:p:2175-2195
    DOI: 10.1287/opre.2022.2414
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2022.2414
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2022.2414?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:71:y:2023:i:6:p:2175-2195. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.