Demo Data from EDBT 2026 / reviewers in the wild / expert
Rui Cao 0005
dblp:86/259-5
· DBLP profile ↗
3ranked-venue papers
3as first author
1since 2021 · last 2022
0000-0002-7744-8781ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 3 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 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
3 papers |
Logic in computer science · 53% Algorithmic game theory and mechanism design · 47% | |
| Artificial intelligence
2 papers |
Multi-agent systems · 100% |
Topics — the 5 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Logic in computer science
modal logic |
0.9 | 2 | 2022 | The Limits of Morality in Strategic Games · IJCAI 2022 Budget-Constrained Dynamics in Multiagent Systems · IJCAI 2017 |
Logic in computer science
sound and complete logical system |
0.9 | 2 | 2022 | The Limits of Morality in Strategic Games · IJCAI 2022 Budget-Constrained Dynamics in Multiagent Systems · IJCAI 2017 |
Algorithmic game theory and mechanism design › non-cooperative game
strategic game |
0.6 | 1 | 2022 | The Limits of Morality in Strategic Games · IJCAI 2022 |
Algorithmic game theory and mechanism design
price of anarchy |
0.4 | 1 | 2020 | Knowing the price of success · Artif. Intell. 2020 |
Algorithmic game theory and mechanism design
pricing |
0.4 | 1 | 2020 | Knowing the price of success · Artif. Intell. 2020 |
Methods — techniques the papers use, named apart from their topics
modal logic · 1.7axiomatization · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | The Limits of Morality in Strategic GamesabstractAn agent, or a coalition of agents, is blameable for an outcome if she had a strategy to prevent it. In this paper we introduce a notion of limited blameworthiness, with a constraint on the amount of sacrifice required to prevent the outcome. The main technical contribution is a sound and complete logical system for reasoning about limited blameworthiness in the strategic game setting. Rui Cao 0005, Pavel Naumov |
IJCAI | 1 |
| 2020 | Knowing the price of success
Rui Cao 0005, Pavel Naumov |
Artif. Intell. | 1 |
| 2017 | Budget-Constrained Dynamics in Multiagent SystemsabstractThe paper introduces a notion of a budget-constrained multiagent transition system that associates two financial parameters with each transition: a pre-transition minimal budget requirement and a post-transition profit. The paper also proposes a new modal language for reasoning about such a system. The language uses a modality labeled by agent as well as by budget and profit constraints. The main technical result is a sound and complete logical system that describes all universal properties of this modality. Among these properties is a form of Transitivity axiom that captures the interplay between the budget and profit constraints. Rui Cao 0005, Pavel Naumov |
IJCAI | 1 |