AI Paper Atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Adapting Stable Matchings to Evolving Preferences

Robert Bredereck, Jiehua Chen, Dušan Knop, Junjie Luo, Rolf Niedermeier

AAAI 2020 · Learning theory and algorithms › Submodular and game algorithms · approach: Matching markets and welfare

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Allow ties in preferences while parameterizing by matching distance kIncremental Stable Roommates · Stable Roommates, ties allowedparameterized complexityHurt
Allow ties in preferences while parameterizing by matching distance kIncremental Stable Marriage · Stable Marriage, ties allowed and preference-profile swap distance 1parameterized complexityHurt
Parameterize no-ties Stable Roommates by the number of shared matching edges k' instead of matching distanceIncremental Stable Roommates · Stable Roommates, no tiesparameterized complexityHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy