23 citations · 36 across the 13 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024
Robust Popular Matchings
Martin Bullinger, Gergely Csáji, Rohith Reddy Gangam +1
We study popularity for matchings under preferences. This solution concept captures matchings that do not lose against any other matching in a majority vote by the agents. A popula…
cs.DS2022
Superiority of Instantaneous Decisions in Thin Dynamic Matching Markets
Johannes Bäumler, Martin Bullinger, Stefan Kober +1
We study a dynamic matching setting where homogeneous agents arrive at random according to a Poisson process and randomly form edges yielding a sparse market. Agents stay in the ma…