Demo Data from SIGIR 2026 / reviewers in the wild / expert
Simon Finster
dblp:351/0385
· DBLP profile ↗
3ranked-venue papers
3as first author
3since 2021 · last 2025
0009-0004-8556-168XORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 3 first-author · 3 since 2021Theory of computation · 3 · 3 first-author · 3 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
3 papers |
Algorithmic game theory and mechanism design · 96% Mathematical optimization · 4% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Medical and health informatics · 100% |
Topics — the 9 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithmic game theory and mechanism design
auction theory |
1.7 | 2 | 2025 | Equitable Auctions · EC 2025 Selling Multiple Complements with Packaging Costs · EC 2025 |
Algorithmic game theory and mechanism design › auction theory
ascending auction |
0.9 | 1 | 2025 | Selling Multiple Complements with Packaging Costs · EC 2025 |
Algorithmic game theory and mechanism design › market equilibrium
competitive equilibrium |
0.9 | 1 | 2025 | Selling Multiple Complements with Packaging Costs · EC 2025 |
Algorithmic game theory and mechanism design › auction theory › sealed-bid auction
pay-as-bid auction |
0.9 | 1 | 2025 | Equitable Auctions · EC 2025 |
Algorithmic game theory and mechanism design › mechanism design › auction design › multi-unit auction
uniform-price auction |
0.9 | 1 | 2025 | Equitable Auctions · EC 2025 |
Algorithmic game theory and mechanism design
resource allocation |
0.7 | 1 | 2023 | Welfare-Maximizing Pooled Testing · EC 2023 |
Algorithmic game theory and mechanism design
welfare maximization |
0.7 | 1 | 2023 | Welfare-Maximizing Pooled Testing · EC 2023 |
Mathematical optimization
linear programming |
0.3 | 1 | 2025 | Selling Multiple Complements with Packaging Costs · EC 2025 |
Medical and health informatics › public health
epidemic testing |
0.2 | 1 | 2023 | Welfare-Maximizing Pooled Testing · EC 2023 |
Methods — techniques the papers use, named apart from their topics
optimization · 1.3prior-free bound · 0.9mechanism design · 0.9linear programming · 0.9ascending auction · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Selling Multiple Complements with Packaging CostsabstractWe consider a package assignment problem with multiple units of indivisible items. The seller can specify preferences over partitions of their supply between buyers as packaging costs. We propose incremental costs together with a graph that defines cost interdependence to express these preferences. This facilitates the use of linear programming to characterize Walrasian equilibrium prices. Firstly, we show that equilibrium prices are uniform, anonymous, and linear in packages. Prices and marginal gains exhibit a nested structure, which we characterize in closed form for complete graphs. Secondly, we provide sufficient conditions for the existence of package-linear competitive prices using an ascending auction implementation. Our framework of partition preferences ensures fair and transparent dual pricing and admits preferences over the concentration of allocated bundles in the market. The full paper is available at https://arxiv.org/abs/2306.14247. Simon Finster |
EC | 1 |
| 2025 | Equitable AuctionsabstractWe initiate the study of how auction design affects the division of surplus among bidders. We propose a parsimonious measure for equity and apply it to standard auctions for homogeneous goods. Our surplus-equitable mechanism is efficient, Bayesian-Nash incentive compatible, and achieves surplus parity among winners ex-post. The uniform-price auction is equity-optimal if and only if bidders have a common value. Against intuition, the pay-as-bid auction is not always equity-preferred if bidders have private values. In auctions with price mixing between pay-as-bid and uniform prices, we provide prior-free bounds on the equity-preferred pricing under a common regularity condition on signals. The full paper is available at https://arxiv.org/abs/2403.07799. Simon Finster, Patrick Loiseau, Simon Mauras, Mathieu Molina, Bary S. R. Pradelski |
EC | 1 |
| 2023 | Welfare-Maximizing Pooled TestingabstractIn an epidemic, how should an organization with limited testing resources safely return to in-person activities after a lockdown? We study this question in a setting where the population is heterogeneous in both utility for in-person activities and probability of infection. During a period of re-integration, tests can be used as a certificate of non-infection, whereby those in negative tests are permitted to return to in-person activities for a designated amount of time. Under the assumption that samples can be pooled, the question of how to allocate a limited testing budget in the population to maximize the aggregate utility (i.e. welfare) of negatively-tested individuals who return to in-person activities is non-trivial, with a large space of potential testing allocations. Simon Finster, Michelle González Amador, Edwin Lock, Francisco J. Marmolejo Cossío, Evi Micha, Ariel D. Procaccia |
EC | 1 |