EDBT 2026 Demo / reviewers in the wild / expert

Süleyman Kerimov

dblp:255/3260 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
Approximation and online algorithms · 50% Algorithmic game theory and mechanism design · 25% Algorithms and data structures · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithms and data structures › dynamic algorithms
dynamic matching		 0.612022
On the Optimality of Greedy Policies in Dynamic Matching · EC 2022
Approximation and online algorithms
greedy policy		 0.612022
On the Optimality of Greedy Policies in Dynamic Matching · EC 2022
Algorithmic game theory and mechanism design
matching		 0.612022
On the Optimality of Greedy Policies in Dynamic Matching · EC 2022
Approximation and online algorithms › online algorithms
online matching		 0.612022
On the Optimality of Greedy Policies in Dynamic Matching · EC 2022

Methods — techniques the papers use, named apart from their topics

greedy policy · 0.6dynamic matching · 0.6
YearPublicationVenuePosition
2022 On the Optimality of Greedy Policies in Dynamic Matching
abstract
We study centralized dynamic matching markets with finitely many agent types and heterogeneous match values. Delaying actions to accumulate "inventory" creates a positive externality from forming future matches that generate high value. This delay, however, inevitably compromises short-term value. The goal of this paper is to shed light on this tension within the family of two-way matching networks.
Süleyman Kerimov, Itai Ashlagi, Itay Gurvich
 EC1
2019 Scrip Systems with Minimal Availability
Itai Ashlagi, Süleyman Kerimov
 WINE2