EDBT 2026 Demo / reviewers in the wild / expert
Jorge Justiniano
dblp:291/5518
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0002-3462-5626ORCID · reported
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 · 77% Mathematical optimization · 23% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithmic game theory and mechanism design › mechanism design › information design
bayesian persuasion |
0.9 | 1 | 2025 | Entropy-Regularized Optimal Transport in Information Design · EC 2025 |
Algorithmic game theory and mechanism design › mechanism design
information design |
0.9 | 1 | 2025 | Entropy-Regularized Optimal Transport in Information Design · EC 2025 |
Mathematical optimization › optimal transport
entropic optimal transport |
0.3 | 1 | 2025 | Entropy-Regularized Optimal Transport in Information Design · EC 2025 |
Mathematical optimization
optimal transport |
0.3 | 1 | 2025 | Entropy-Regularized Optimal Transport in Information Design · EC 2025 |
Methods — techniques the papers use, named apart from their topics
power diagram · 0.9entropy-regularized optimal transport · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Entropy-Regularized Optimal Transport in Information DesignabstractIn this paper, we explore a scenario where a sender provides an information policy and a receiver, upon observing a realization of this policy, decides whether to take a particular action, such as making a purchase. The sender's objective is to maximize her utility derived from the receiver's action, and she achieves this by careful selection of the information policy. Building on the work of Kleiner et al., our focus lies specifically on information policies that are associated with power diagram partitions of the underlying domain. To address this problem, we employ entropy-regularized optimal transport, which enables us to develop an efficient algorithm for finding the optimal solution. We present experimental numerical results that highlight the qualitative properties of the optimal configurations, providing valuable insights into their structure. Furthermore, we extend our numerical investigation to derive optimal information policies for monopolists dealing with multiple products, where the sender discloses information about product qualities. Jorge Justiniano, Andreas Kleiner, Benny Moldovanu, Martin Rumpf, Philipp Strack |
EC | 1 |