Optimal Near-Feasible Stable Matching Experiments

Zenodo (CERN European Organization for Nuclear Research) 2026 Open access

Read full text
Authors: Frederik Glitzner
DOI: 10.5281/zenodo.18299412
Cited by: 0

Abstract

Algorithms and experiments for optimal near-feasible stable matchings in the Stable Fixtures problem. Accompanies paper "Near-Feasible Stable Matchings: Incentives and Optimality" (to appear). See the README for more information.

Fields of Study & Subjects

Game Theory and Voting Systems Constraint Satisfaction and Optimization Optimization and Search Problems

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
19 January 2026