Demo Data from EDBT 2026 / reviewers in the wild / expert
Alexander Zentefis
dblp:349/2658
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2025
0000-0003-4424-8828ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 3 since 2021Theory of computation · 2 · 2 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.
| Artificial intelligence
2 papers |
Trustworthy machine learning · 52% Information extraction and text analysis · 40% Learning theory · 8% | |
| Theoretical computer science
2 papers |
Algorithmic game theory and mechanism design · 45% Mathematical optimization · 28% Computational geometry · 28% | |
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Computational finance and economics · 77% Computational social science and digital humanities · 23% |
Topics — the 8 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning
interpretability |
0.9 | 1 | 2025 | Explaining Models · EC 2025 |
Machine learning › Trustworthy machine learning › interpretability
model explanation |
0.9 | 1 | 2025 | Explaining Models · EC 2025 |
Algorithmic game theory and mechanism design › decision theory
decision making under uncertainty |
0.9 | 1 | 2025 | Explaining Models · EC 2025 |
Natural language and speech › Information extraction and text analysis
dialogue analysis |
0.7 | 1 | 2023 | Language of Bargaining · ACL (1) 2023 |
Natural language and speech › Information extraction and text analysis › dialogue analysis
speech act recognition |
0.7 | 1 | 2023 | Language of Bargaining · ACL (1) 2023 |
Mathematical optimization
convex analysis |
0.7 | 1 | 2023 | Extreme Points and First-Order Stochastic Dominance: Theory and Applications · EC 2023 |
Computational geometry › convex hull
extreme points |
0.7 | 1 | 2023 | Extreme Points and First-Order Stochastic Dominance: Theory and Applications · EC 2023 |
Algorithmic game theory and mechanism design › mechanism design
information design |
0.2 | 1 | 2023 | Extreme Points and First-Order Stochastic Dominance: Theory and Applications · EC 2023 |
Methods — techniques the papers use, named apart from their topics
robust optimization · 1.7decision theory · 1.7probability theory · 1.3prediction task · 1.3convex analysis · 1.3annotation study · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Explaining ModelsabstractWe study when and how explanations of complex models can aid a decision maker (DM) whose payoff depends on a state of the world described by inputs and outputs. The DM cannot directly understand the true model linking inputs to outputs and must instead rely on an explanation from a class of simpler intelligible models. We analyze mappings from the infinite-dimensional space of possible true models to the finite-dimensional space of intelligible ones — what we call explainers — and focus on those that yield explanations which are robustly useful: that is, they allow the DM to improve their worst-case payoff across all models that are consistent with the explanation received. Kai-Hao Yang, Nathan Yoder, Alexander Zentefis |
EC | 3 |
| 2023 | Language of BargainingabstractLeveraging an established exercise in negotiation education, we build a novel dataset for studying how the use of language shapes bilateral bargaining.Our dataset extends existing work in two ways: 1) we recruit participants via behavioral labs instead of crowdsourcing platforms and allow participants to negotiate through audio, enabling more naturalistic interactions; 2) we add a control setting where participants negotiate only through alternating, written numeric offers.Despite the two contrasting forms of communication, we find that the average agreed prices of the two treatments are identical.But when subjects can talk, fewer offers are exchanged, negotiations finish faster, the likelihood of reaching agreement rises, and the variance of prices at which subjects agree drops substantially.We further propose a taxonomy of speech acts in negotiation and enrich the dataset with annotated speech acts.We set up prediction tasks to predict negotiation success and find that being reactive to the arguments of the other party is advantageous over driving the negotiation. Mourad Heddaya, Solomon Dworkin, Chenhao Tan, Rob Voigt, Alexander Zentefis |
ACL (1) | 5 |
| 2023 | Extreme Points and First-Order Stochastic Dominance: Theory and ApplicationsabstractWe characterize the extreme points of first-order stochastic dominance (FOSD) intervals and show how these intervals are at the heart of many topics in economics. An FOSD interval is a set of distributions that dominate a distribution and are simultaneously dominated by another distribution, in the sense of FOSD. The convexity of FOSD intervals means that their extreme points are fundamental to understanding their properties. We show that a distribution is an extreme point of an FOSD interval if and only if the distribution either coincides with one of the FOSD bounds or is flat. Wherever the distribution is flat, at least one end of the flat portion must be attached to one of the FOSD bounds. Kai-Hao Yang, Alexander Zentefis |
EC | 2 |