EDBT 2026 Demo / reviewers in the wild / expert
Gildas Jeantet
dblp:21/5551
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 2012
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author
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 · 86% Mathematical optimization · 14% | |
| Artificial intelligence
2 papers |
Planning, search and constraint satisfaction · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithmic game theory and mechanism design › decision theory
decision making under uncertainty |
0.1 | 1 | 2012 | Sequential Decision Making with Rank Dependent Utility: A Minimax Regret Approach · AAAI 2012 |
Algorithmic game theory and mechanism design
decision theory |
0.1 | 1 | 2011 | Resolute Choice in Sequential Decision Problems with Multiple Priors · IJCAI 2011 |
Mathematical optimization › online optimization
minimax regret |
0.0 | 1 | 2012 | Sequential Decision Making with Rank Dependent Utility: A Minimax Regret Approach · AAAI 2012 |
Methods — techniques the papers use, named apart from their topics
search procedure · 0.1minimax regret · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | Sequential Decision Making with Rank Dependent Utility: A Minimax Regret ApproachabstractThis paper is devoted to sequential decision making with Rank Dependent expected Utility (RDU). This decision criterion generalizes Expected Utility and enables to model a wider range of observed (rational) behaviors. In such a sequential decision setting, two conflicting objectives can be identified in the assessment of a strategy: maximizing the performance viewed from the initial state (optimality), and minimizing the incentive to deviate during implementation (deviation-proofness). In this paper, we propose a minimax regret approach taking these two aspects into account, and we provide a search procedure to determine an optimal strategy for this model. Numerical results are presented to show the interest of the proposed approach in terms of optimality, deviation-proofness and computability. Gildas Jeantet, Patrice Perny, Olivier Spanjaard |
AAAI | 1 |
| 2011 | Resolute Choice in Sequential Decision Problems with Multiple PriorsabstractInternational audience Hélène Fargier, Gildas Jeantet, Olivier Spanjaard |
IJCAI | 2 |
| 2011 | Computing rank dependent utility in graphical models for sequential decision problems
Gildas Jeantet, Olivier Spanjaard |
Artif. Intell. | 1 |