This code can be used in traditional school choice settings (strict student preferences, weak school priorities) to compute a random assignment that is ex-post stable (i.e., can be decomposed over weakly stable deterministic matchings), and that sd-dominates upon a given random assignment. More information can be found in our paper Smart Lotteries in School Choice: Ex-Ante Improvement with Ex-Post Stability.
Embedded Files
How to fairly select one of the (possibly many) optimal solutions of an integer program? This code, written in C++, implements several distribution rules to tackle this problem, for integer programming formulation with dichotomous preferences (binary variables) or integer preferences (cardinal variables). More information can be found in our paper Fair integer programming under dichotomous and cardinal preferences.
This code can be used to compute the Rawlsian assignment for a given one-sided matching problem, as introduced in our paper Rawlsian assignments.
This code was used in our paper Relaxed core stability for hedonic games with size-dependent utilities to verify whether an instance of a hedonic game satisfies the core-relaxation concepts introduced in our paper..
This code, written in C++, can be used to generate instances for the one-sided matching problem. The parameters in the code are inspired by real-world school choice instances from Belgian cities Antwerp & Ghent (with the default parameter values set to those from Ghent). This data generator was used to generate the data in our paper A pessimist’s approach to one-sided matching, and the paper contains a description of both the available parameters and the data generation process.
The code that was used in Erdil & Ergin (2008) to compute stable improvement cycles sometimes generated unstable matchings. I identify the minor bug in their code that caused this issue, and I present a corrected implementation.
Page updated
Google Sites
Report abuse