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

Théo Durandard

dblp:410/3655 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
0009-0005-6331-1345ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Theory of computation · 2 · 2 first-author · 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.

Theoretical computer science
2 papers
Algorithmic game theory and mechanism design · 94% Algorithms and data structures · 6%

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

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › mechanism design
contract design
1.722025
Robust Contracting for Sequential Search · EC 2025
Robust Regulation of Labour Contracts · EC 2025
Algorithmic game theory and mechanism design › mechanism design › contract theory
moral hazard
1.722025
Robust Contracting for Sequential Search · EC 2025
Robust Regulation of Labour Contracts · EC 2025
Algorithmic game theory and mechanism design › mechanism design › contract theory
principal-agent problem
0.312025
Robust Regulation of Labour Contracts · EC 2025
Algorithms and data structures › search algorithms
sequential search
0.312025
Robust Contracting for Sequential Search · EC 2025

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

worst-case regret minimization · 0.9worst-case analysis · 0.9
YearPublicationVenuePosition
2025 Robust Regulation of Labour Contracts
abstract
We study the robust regulation of incentive contracts. We consider the problem of a regulator choosing what contracts to authorize in the canonical principal-agent model with moral hazard. A firm (she) contracts with a worker (he), who then takes a costly productive action that yields a stochastic output. Hiring the worker imposes a fixed cost for the firm. The set of productive actions and the fixed cost define the firm's technology. The worker's actions being non-contractible, the firm incentivises production by offering an (authorised) contract that maps realised outputs to payments. We assume the firm and the worker are protected by limited liability, they are risk-neutral, and they maximise their profit and surplus. We add a third player to that standard model: the regulator (they). They choose the regulation, which is the set of authorised contracts the firm can offer. We assume that the regulator's payoff is a weighted sum of the firm's profit and the worker's surplus, where the latter has a (weakly) greater weight α ≥ 1. While the firm and the worker know the technology, the regulator has no information. They choose a regulation that minimises their worst-case regret.
Théo Durandard, Alexis Ghersengorin
EC1
2025 Robust Contracting for Sequential Search
abstract
How should a principal incentivize an agent to explore risky alternatives when the principal has limited knowledge of these alternatives? We study this question in a robust moral hazard model in which the agent sequentially searches over projects to generate a prize. At the outset, the principal only knows one of these projects, and evaluates contracts by their worst-case performance.
Théo Durandard, Udayan Vaidya, Boli Xu
EC1