Computing a common prior

DOI10.1016/J.ORL.2024.107134MaRDI QIDQ6988632zbMATH OpenFDO

Authors Marianna Eisenberg-Nagy, Miklós Pintér

Publication date 3 May 2025

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2024.107134

zbMATH Keywords

agreeable betcommon priorcomputational complexityFredholm alternativestrongly polynomialtype space

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Fundamental topics (basic mathematics, methodology; applicable to economics in general) (91B02) Trade models (91B60)

Cites work

• A Simple Proof of the Fredholm Alternative and a Characterization of the Fredholm Operators
• Belief consistency and trade consistency
• Characterizing common priors in the form of posteriors
• Charges and bets: a general characterisation of common priors
• Common priors and separation of convex sets
• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 3155579 (Why is no real title available?)
• scientific article; zbMATH DE number 3672004 (Why is no real title available?)
• Infinite dimensional analysis. A hitchhiker's guide.
• Sur une classe d'équations fonctionnelles.
• Systems of distinct representatives and linear algebra
• The positive foundation of the common prior assumption
• The role of pivoting in proving some fundamental theorems of linear algebra
• Theorie der einfachen Ungleichungen.
• Trade with Heterogeneous Prior Beliefs and Asymmetric Information
• Zur Theorie der Gesellschaftsspiele.

Cited in

(1)

• The sound of silence: when to listen to a Bayesian persuader under costly information acquisition in a supply chain

This page was built for publication: Computing a common prior

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988632)