Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Doron Ravid

dblp:308/9181 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2024
0000-0002-4631-4844ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Theory of computation · 3 · 1 first-author · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
3 papers
Algorithmic game theory and mechanism design · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › mechanism design
information design
0.812024
Monopoly, Product Quality, and Flexible Learning · EC 2024
Algorithmic game theory and mechanism design
mechanism design
0.812024
Monopoly, Product Quality, and Flexible Learning · EC 2024
Algorithmic game theory and mechanism design › pricing
monopoly pricing
0.812024
Monopoly, Product Quality, and Flexible Learning · EC 2024
Algorithmic game theory and mechanism design › decision theory
information acquisition
0.212024
Robust Predictions in Games with Rational Inattention · EC 2024

Methods — techniques the papers use, named apart from their topics

welfare analysis · 0.8mechanism design · 0.8information theory · 0.8information design · 0.8rational inattention · 0.7bayesian decision theory · 0.7
YearPublicationVenuePosition
2024 Robust Predictions in Games with Rational Inattention
abstract
We derive robust predictions in games involving flexible information acquisition, also known as rational inattention (Sims 2003). These predictions remain accurate regardless of the exact specification of players' learning abilities. Compared to scenarios where information is predetermined, rational inattention reduces welfare and introduces additional constraints on behavior. We show these constraints have an "all-or-nothing" flavor: the set of behaviors consistent with rational inattention is either dense or nowhere-dense in the set of behaviors consistent with exogenously given information. Moreover, the latter case is generic; the two knowledge regimes are behaviorally indistinguishable in most environments.
Tommaso Denti, Doron Ravid
EC2
2024 Monopoly, Product Quality, and Flexible Learning
abstract
A seller offers a buyer a schedule of transfers and associated product qualities. After observing this schedule, the buyer chooses a flexible costly signal about his type. We show it is without loss to focus on a class of mechanisms that compensate the buyer for his learning costs. Focusing attention on these mechanisms allows one to employ techniques from both the information design and mechanism design toolkits.
Doron Ravid, Jeffrey Mensch
EC1
2023 Predicting Choice from Information Costs
abstract
We study a canonical flexible-learning model in which an agent chooses from a finite set of alternatives, the benefits from which depend on a stochastic state. Before making her decision, the agent chooses what signal to acquire about this state. Learning comes at a cost, which the agent subtracts from the expected benefit she derives from her final decision. After choosing her information, the agent observes a signal realization and takes an action.
Elliot Lipnowski, Doron Ravid
EC2