EDBT 2026 Demo / reviewers in the wild / expert
Omer Shiran-Shvarzbard
dblp:269/4609
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2020
—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.
| Theoretical computer science
1 paper |
Algorithmic game theory and mechanism design · 100% |
Topics — the 1 heaviest of 1, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithmic game theory and mechanism design › mechanism design
contest design |
0.4 | 1 | 2020 | Competition Among Contests: a Safety Level Analysis · IJCAI 2020 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Competition Among Contests: a Safety Level AnalysisabstractWe study a competition among two contests, where each contest designer aims to attract as much effort as possible. Such a competition exists in reality, e.g., in crowd-sourcing websites. Our results are phrased in terms of the ``relative prize power'' of a contest, which is the ratio of the total prize offered by this contest designer relative to the sum of total prizes of the two contests. When contestants have a quasi-linear utility function that captures both a risk-aversion effect and a cost of effort, we show that a simple contest attracts a total effort which approaches the relative prize power of the contest designer assuming a large number of contestants. This holds regardless of the contest policy of the opponent, hence providing a ``safety level'' which is a robust notion similar in spirit to the max-min solution concept. Ron Lavi, Omer Shiran-Shvarzbard |
IJCAI | 2 |