atlas

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

Welfare Guarantees in Schelling Segregation

AAAI 2021 · Learning theory and algorithms › Submodular and game algorithms · approach: Matching markets and welfare · 21 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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
Assign agents uniformly at random to topology nodesSchelling instances with n agents · General Schelling instancessocial welfare: g(n)Helped
Derandomize assignment by choosing each next type to maximize conditional expected welfareSchelling instances with n agents · General Schelling instancessocial welfare: at least g(n); g(n) ≥ n/2 - 1Helped
Require a topology with minimum degree at least 2 and equal numbers of agents and nodesSchelling instances with at least two agents of each type · Topology with minimum degree at least 2positive-utility agents: every agentHelped
Use depth-first search to place agents of the majority type firstSchelling instances with n≥3 · General connected topologiesnumber of positive-utility agents: at least ceil n/2Helped
Restrict the topology to a treePareto-optimal assignments · Tree topologies, n≥3social welfare lower bound: 1/sqrt{n} -> n/(n-1)Helped

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