paper-with-me

홈 › Papers

Blackwell-Monotone Updating Rules

2023-02-27 · Mark Whitmeyer

An updating rule specifies how an agent reacts to information. An updating rule is Blackwell monotone if more information is always better for an agent in a decision problem and strictly Blackwell monotone if, in addition, there is always a decision problem in which more information is strictly better for an agent. Bayes' law is strictly Blackwell monotone, and I show that within a broad class of updating rules--those that distort the Bayesian posteriors in a signal-independent manner--it is the only strictly Blackwell-monotone updating rule. Moreover, when the state is non-binary, I show that Bayes' law and the trivial updating rule in which an agent dogmatically holds a single belief are the only continuous Blackwell-monotone updating rules.

📄 PDF Abstract BibTeX arXiv:2302.13956

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Information and Learning in Economic Theory

2022-12-14 · Annie Liang

These lecture notes accompany a one-semester graduate course on information and learning in economic theory. Topics include common knowledge, Bayesian updating, monotone-likelihood ratio properties, affiliation, the Blac…

Blackwell-Monotone Information Costs

2024-04-23 · Xiaoyu Cheng, Yonggyun Kim

A Blackwell-monotone information cost function assigns higher costs to Blackwell more informative experiments. This paper provides simple necessary and sufficient conditions for a cost function to be Blackwell monotone o…

Blackwell's Approachability with Approximation Algorithms

2025-02-06 · Dan Garber, Mhna Massalha

We revisit Blackwell's celebrated approachability problem which considers a repeated vector-valued game between a player and an adversary. Motivated by settings in which the action set of the player or adversary (or both…

Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds

2020-12-01 · NeurIPS 2020 12 · Nicholas Harvey, Christopher Liaw, Tasuku Soma

We consider the problem of nonnegative submodular maximization in the online setting. At time step t, an algorithm selects a set St ∈ C ⊆ 2^V where C is a feasible family of sets. An adversary then reveals a submodular f…

Strategyproofness and Monotone Allocation of Auction in Social Networks

2025-07-19 · Yuhang Guo, Dong Hao, Bin Li, Mingyu Xiao 외 arxiv

Strategyproofness in network auctions requires that bidders not only report their valuations truthfully, but also do their best to invite neighbours from the social network. In contrast to canonical auctions, where the v…