[ΒΙΒΛΙΟ][B] Combinatorial optimization: papers from the DIMACS Special Year
Combinatorial optimization: papers from the DIMACS Special Year Page 1 DIMACS Series in
Discrete Mathematics and Theoretical Computer Science Volume 20 Combinatorial …
Discrete Mathematics and Theoretical Computer Science Volume 20 Combinatorial …
Matching with contracts
We develop a model of matching with contracts which incorporates, as special cases, the
college admissions problem, the Kelso-Crawford labor market matching model, and …
college admissions problem, the Kelso-Crawford labor market matching model, and …
Deferred acceptance algorithms: History, theory, practice, and open questions
AE Roth - international Journal of game Theory, 2008 - Springer
The deferred acceptance algorithm proposed by Gale and Shapley (1962) has had a
profound influence on market design, both directly, by being adapted into practical matching …
profound influence on market design, both directly, by being adapted into practical matching …
Recent developments in discrete convex analysis
K Murota - Research Trends in Combinatorial Optimization: Bonn …, 2009 - Springer
This paper describes recent developments in discrete convex analysis. Particular emphasis
is laid on natural introduction of the classes of L-convex and M-convex functions in discrete …
is laid on natural introduction of the classes of L-convex and M-convex functions in discrete …
School choice with controlled choice constraints: Hard bounds versus soft bounds
Controlled choice over public schools attempts giving parents selection options while
maintaining diversity of different student types. In practice, diversity constraints are often …
maintaining diversity of different student types. In practice, diversity constraints are often …
Efficient matching under distributional constraints: Theory and applications
Y Kamada, F Kojima - American Economic Review, 2015 - aeaweb.org
Many real matching markets are subject to distributional constraints. These constraints often
take the form of restrictions on the numbers of agents on one side of the market matched to …
take the form of restrictions on the numbers of agents on one side of the market matched to …
Matching with (branch‐of‐choice) contracts at the United States Military Academy
T Sönmez, TB Switzer - Econometrica, 2013 - Wiley Online Library
Branch selection is a key decision in a cadet's military career. Cadets at USMA can increase
their branch priorities at a fraction of slots by extending their service agreement. This real …
their branch priorities at a fraction of slots by extending their service agreement. This real …
Applications of matching models under preferences
P Biró - 2017 - books.google.com
Matching problems under preferences have been studied widely in mathematics, computer
science and economics, starting with the seminal paper by Gale and Shapley (1962). A …
science and economics, starting with the seminal paper by Gale and Shapley (1962). A …
A theory of stability in many-to-many matching markets
We develop a theory of stability in many-to-many matching markets. We give conditions
under which the setwise-stable set, a core-like concept, is nonempty and can be …
under which the setwise-stable set, a core-like concept, is nonempty and can be …
[PDF][PDF] Tight approximation algorithms for maximum general assignment problems
A separable assignment problem (Ë È) is defined by a set of bins and a set of items to pack
in each bin; a value,, for assigning item to bin; and a separate packing constraint for each …
in each bin; a value,, for assigning item to bin; and a separate packing constraint for each …