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

Frédéric Koessler

dblp:28/545 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · unresolved

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 first-author · 1 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
1 paper
Algorithmic game theory and mechanism design · 100%

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

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › mechanism design › information design
bayesian persuasion
0.812024
A belief-based approach to signaling · EC 2024
Algorithmic game theory and mechanism design › equilibrium analysis
equilibrium characterization
0.812024
A belief-based approach to signaling · EC 2024
Algorithmic game theory and mechanism design › imperfect information games
signaling game
0.812024
A belief-based approach to signaling · EC 2024

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

convex analysis · 0.8bayes-plausible beliefs · 0.8
YearPublicationVenuePosition
2024 A belief-based approach to signaling
abstract
In this paper, we provide a geometric characterization of the set of interim equilibrium payoffs in a general class of signaling games. To obtain a tractable characterization, we use the belief based approach found in the literature on repeated games with incomplete information, cheap talk and Bayesian persuasion. This approach avoids to specify the prior, the strategies of the sender and receiver, and the belief system. The key ingredient is to consider Bayes-plausible belief distributions that are incentive-compatible for the sender. Geometrically, this leads to a constrained convexification of the graphs of the interim value correspondences. Our characterization extends the analogous result for sender-receiver cheap talk games. We illustrate the results with some classical signaling games. We derive the best equilibrium payoff for the sender when his preferences are type-independent. For zero-sum preferences, we obtain an explicit formula for the ex-ante equilibrium payoff and establish a simple condition for the uniqueness of interim equilibrium payoffs.
Frédéric Koessler, Marie Laclau, Tristan Tomala
EC1