Demo Data from EDBT 2026 / reviewers in the wild / expert
Michele Budinich
dblp:55/8468
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorTheory of computation · 1 · 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
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 |
|---|---|---|---|---|
Algorithmic game theory and mechanism design
limited randomness |
0.1 | 1 | 2011 | Repeated matching pennies with limited randomness · EC 2011 |
Algorithmic game theory and mechanism design › solution concepts in games › equilibrium concepts
nash equilibrium |
0.1 | 1 | 2011 | Repeated matching pennies with limited randomness · EC 2011 |
Algorithmic game theory and mechanism design
repeated games |
0.1 | 1 | 2011 | Repeated matching pennies with limited randomness · EC 2011 |
Methods — techniques the papers use, named apart from their topics
game theory · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | Repeated matching pennies with limited randomnessabstractWe consider a repeated Matching Pennies game in which players have limited access to randomness. Playing the (unique) Nash equilibrium in this n-stage game requires n random bits. Can there be Nash equilibria (or epsilon-Nash equilibria) that use less than n random coins? Michele Budinich, Lance Fortnow |
EC | 1 |