AI Paper Atlas

Research map / Learning theory and algorithms / Fairness

Balancing Bias in Two-sided Markets for Fair Stable Matchings

Siyuan Wu, Leong Hou U, Panagiotis Karras

ICLR 2025 · Learning theory and algorithms › Fairness · approach: Fair allocation and selection

Read the paperCheck your idea against 137,217 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Studies the Balanced Stable Marriage problem and proposes an approximate approach for finding stable matchings that minimize the maximum dissatisfaction across the two sides in a two-sided market.

Problem

The Balanced Stable Marriage (BSM) problem: finding a stable matching in a two-sided market that minimizes the maximum dissatisfaction between the two sides; NP-hard, while Deferred Acceptance yields unfair stable matchings.

Approach

Targets the NP-hard BSM problem with approximation methods rather than exact solvers, aiming to balance bias between the two sides of a stable matching. Details beyond the abstract are not available.

Experimental setup

Baselines: Deferred Acceptance

Builds on: Deferred Acceptance

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