VLDB 2026 Research / reviewers in the wild / expert
Deniz Kattwinkel
dblp:243/2601
· DBLP profile ↗
2ranked-venue papers
2as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 first-author · 1 since 2021Theory of computation · 2 · 2 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Mechanisms without Transfers for Fully Biased AgentsabstractA principal must decide between two options. Which one she prefers depends on the private information of two agents. One agent always prefers the first option; the other always prefers the second. Transfers are infeasible. One application of this setting is the efficient division of a fixed budget between two competing departments. We first characterize all implementable mechanisms under arbitrary correlation. Second, we study when there exists a mechanism that yields the principal a higher payoff than she could receive by choosing the ex-ante optimal decision without consulting the agents. In the budget example, such a profitable mechanism exists if and only if the information of one department is also relevant for the expected returns of the other department. We generalize this insight to derive necessary and sufficient conditions for the existence of a profitable mechanism in the n-agent allocation problem with independent types. Deniz Kattwinkel, Axel Niemeyer, Justus Preusser, Alexander Winter |
EC | 1 |
| 2020 | Allocation with Correlated Information: Too Good to be TrueabstractA principal can allocate a good to an agent. The agent privately learns the value of the good while the principal privately learns the cost. Value and cost are correlated. The agent wants to have the good in any case. The principal wants to allocate whenever the value exceeds the cost. She cannot use monetary transfers to screen the agent. Deniz Kattwinkel |
EC | 1 |