EDBT 2026 Demo / reviewers in the wild / expert
Meir Bing
dblp:78/199
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2004
—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 › auction theory
combinatorial auction |
0.0 | 1 | 2004 | Presentation and structure of substitutes valuations · EC 2004 |
Algorithmic game theory and mechanism design › market design › combinatorial markets
gross substitutes |
0.0 | 1 | 2004 | Presentation and structure of substitutes valuations · EC 2004 |
Algorithmic game theory and mechanism design › social choice › computational social choice › preference representation
valuation functions |
0.0 | 1 | 2004 | Presentation and structure of substitutes valuations · EC 2004 |
Methods — techniques the papers use, named apart from their topics
k-satiation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2004 | Presentation and structure of substitutes valuationsabstractWe propose two different methods for presenting substitutes (a.k.a. gross-substitutes) valuations. Each provides short descriptions for a family of substitutes valuations. We also show that substitutes valuation are closed under k-satiation. Meir Bing, Daniel Lehmann 0001, Paul Milgrom |
EC | 1 |