Pages that link to "Item:Q5904119"
From MaRDI portal
The following pages link to College Admissions and the Stability of Marriage (Q5904119):
Displaying 50 items.
- The hospitals/residents problem with lower quotas (Q261379) (← links)
- Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings (Q266919) (← links)
- Enrollment manipulations in school choice (Q268634) (← links)
- Volume of trade and dynamic network formation in two-sided economies (Q268644) (← links)
- Fair matchings and related problems (Q270032) (← links)
- A coloring property for stable allocations (Q274058) (← links)
- Strategyproof matching with regional minimum and maximum quotas (Q274410) (← links)
- Matching with aggregate externalities (Q277295) (← links)
- Fair implementation of diversity in school choice (Q290161) (← links)
- Object allocation via deferred-acceptance: strategy-proofness and comparative statics (Q290170) (← links)
- Skorokhod embeddings for two-sided Markov chains (Q292133) (← links)
- Modelling practical placement of trainee teachers to schools (Q301931) (← links)
- College admissions with stable score-limits (Q302118) (← links)
- Random decentralized market processes for stable job matchings with competitive salaries (Q308603) (← links)
- On the importance of uniform sharing rules for efficient matching (Q308609) (← links)
- Transferring ownership of public housing to existing tenants: a market design approach (Q308656) (← links)
- The blocking lemma and group incentive compatibility for matching with contracts (Q309845) (← links)
- \(d\)-dimensional stable matching with cyclic preferences (Q309847) (← links)
- Matching couples with Scarf's algorithm (Q314433) (← links)
- A branch-and-price algorithm for stable workforce assignments with hierarchical skills (Q322747) (← links)
- Improved algorithmic results for unsplittable stable allocation problems (Q326457) (← links)
- Modeling cooperative decision situations: the deviation function form and the equilibrium concept (Q328575) (← links)
- Stable matchings of teachers to schools (Q329714) (← links)
- Network formation games with teams (Q333783) (← links)
- Improving schools through school choice: a market design approach (Q337801) (← links)
- Integer programming methods for special college admissions problems (Q346530) (← links)
- An analysis of the German university admissions system (Q361830) (← links)
- Analysis of stochastic matching markets (Q378330) (← links)
- The economic value of virtue (Q381047) (← links)
- Local and global consistency properties for student placement (Q386062) (← links)
- Application fee manipulations in matching markets (Q393269) (← links)
- Strategy-proof stochastic assignment (Q402069) (← links)
- Stable marriages and search frictions (Q402071) (← links)
- On the advice complexity of online bipartite matching and online stable marriage (Q402379) (← links)
- Fictitious students creation incentives in school choice problems (Q403704) (← links)
- On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets (Q404743) (← links)
- A simple sufficient condition for strong implementation (Q405557) (← links)
- School choice with controlled choice constraints: hard bounds versus soft bounds (Q406428) (← links)
- Dominant strategy implementation of stable rules (Q417718) (← links)
- Partnership formation based on multiple traits (Q421789) (← links)
- School choice: impossibilities for affirmative action (Q423742) (← links)
- Comparing school choice mechanisms by interim and ex-ante welfare (Q423772) (← links)
- ``Almost stable'' matchings in the roommates problem with bounded preference lists (Q428844) (← links)
- Quasi stable outcomes in the assignment game (Q430896) (← links)
- Two-sided micro-matching with technical progress (Q431223) (← links)
- The Pareto-dominant strategy-proof and fair rule for problems with indivisible goods (Q431227) (← links)
- The complexity of approximately counting stable roommate assignments (Q440007) (← links)
- The complexity of approximately counting stable matchings (Q441846) (← links)
- Improved approximation bounds for the student-project allocation problem with preferences over projects (Q450528) (← links)
- Stable assignment with couples: parameterized complexity and local search (Q456691) (← links)
