Demo Data from SIGIR 2026 / reviewers in the wild / expert
Valeriy Bulitko
dblp:54/6086
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1
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
1 paper |
Planning, search and constraint satisfaction · 50% Multi-agent systems · 50% | |
| Theoretical computer science
1 paper |
Algorithmic game theory and mechanism design · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
game playing |
0.1 | 1 | 2005 | Effective Short-Term Opponent Exploitation in Simplified Poker · AAAI 2005 |
Knowledge, reasoning and agents › Multi-agent systems › imperfect information games
poker |
0.1 | 1 | 2005 | Effective Short-Term Opponent Exploitation in Simplified Poker · AAAI 2005 |
Algorithmic game theory and mechanism design › learning in games
opponent exploitation |
0.1 | 1 | 2005 | Effective Short-Term Opponent Exploitation in Simplified Poker · AAAI 2005 |
Methods — techniques the papers use, named apart from their topics
game theory · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2005 | Effective Short-Term Opponent Exploitation in Simplified Poker
Bret Hoehn, Finnegan Southey, Robert C. Holte, Valeriy Bulitko |
AAAI | 4 |