Demo Data from SIGIR 2026 / reviewers in the wild / expert
Ori Zviran
dblp:277/9204
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 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
1 paper |
Algorithmic game theory and mechanism design · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithmic game theory and mechanism design › auction theory
interdependent values |
0.5 | 1 | 2021 | PoA of Simple Auctions with Interdependent Values · AAAI 2021 |
Algorithmic game theory and mechanism design
price of anarchy |
0.5 | 1 | 2021 | PoA of Simple Auctions with Interdependent Values · AAAI 2021 |
Methods — techniques the papers use, named apart from their topics
smoothness framework · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | PoA of Simple Auctions with Interdependent ValuesabstractWe expand the literature on the price of anarchy (PoA) of simultaneous item auctions by considering settings with correlated values; we do this via the fundamental economic model of interdependent values (IDV). It is well-known that in multi-item settings with private values, correlated values can lead to bad PoA, which can be polynomially large in the number of agents~n. In the more general model of IDV, we show that the PoA can be polynomially large even in single-item settings. On the positive side, we identify a natural condition on information dispersion in the market, which enables good PoA guarantees. Under this condition, we show that for single-item settings, the PoA of standard mechanisms degrades gracefully. For settings with multiple items we show a separation between two domains: If there are more buyers, we devise a new simultaneous item auction with good PoA, under limited information asymmetry. To the best of our knowledge, this is the first positive PoA result for correlated values in multi-item settings. The main technical difficulty in establishing this result is that the standard tool for establishing PoA results --- the smoothness framework --- is unsuitable for IDV settings, and so we must introduce new techniques to address the unique challenges imposed by such settings. In the domain of more items, we establish impossibility results even for surprisingly simple scenarios. Alon Eden, Michal Feldman, Inbal Talgam-Cohen, Ori Zviran |
AAAI | 4 |