Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Stability and Polarization of Interests in Job Matching - MaRDI portal

Stability and Polarization of Interests in Job Matching

From MaRDI portal
Publication:3040872

DOI10.2307/1911460zbMath0526.90012OpenAlexW2062139011MaRDI QIDQ3040872

Alvin E. Roth

Publication date: 1984

Published in: Econometrica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1911460




Related Items

Testing substitutability of weak preferencesReview of the theory of stable matchings and contract systemsStable matching: An integer programming approachThe structure of equilibria in trading networks with frictionsOn the Construction of SubstitutesPopular critical matchings in the many-to-many settingExpectational equilibria in many-to-one matching models with contractsRelaxing the substitutes condition in matching markets with contractsStable schedule matchingsTwo-Sided Matching ModelsJob matching and coalition formation with utility or disutility of co-workersRandom paths to pairwise stability in many-to-many matching problems: a study on market equilibrationOn the invariance of the set of stable matchings with respect to substitutable preference profilesA general two-sided matching market with discrete concave utility functionsCredible group stability in many-to-many matching problemsAffinely representable lattices, stable matchings, and choice functionsAffinely representable lattices, stable matchings, and choice functionsUnnamed ItemUnnamed ItemMatroidal Choice FunctionsMATCHING WITH COUPLES: A MULTIDISCIPLINARY SURVEYOn the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave MarketStrategic Issues in One-to-One Matching with ExternalitiesThe college admissions problem is not equivalent to the marriage problemIncentives in landing slot problemsFair implementation of diversity in school choiceObject allocation via deferred-acceptance: strategy-proofness and comparative staticsPolynomial time algorithm for an optimal stable assignment with multiple partnersConnecting the cooperative and competitive structures of the multiple-partners assignment gameInterdistrict school choice: a theory of student assignmentCollege admissions with stable score-limitsObject allocation via immediate-acceptance: characterizations and an affirmative action applicationOne-to-many non-cooperative matching gamesThe blocking lemma and group incentive compatibility for matching with contractsA branch-and-price algorithm for stable workforce assignments with hierarchical skillsModeling cooperative decision situations: the deviation function form and the equilibrium conceptBeyond the Spanish MIR with consent: (hidden) cooperation and coordination in matchingEntry and structures of interest groups in assignment gamesLone wolves in infinite, discrete matching marketsStrategy-proofness of worker-optimal matching with continuously transferable utilityConsistent bargaining conjectures in marriage and matchingInterior points in the core of two-sided matching marketsCompetitive equilibrium in an exchange economy with indivisibilitiesAn analysis of the German university admissions systemA one-sided many-to-many matching problemA stable and Pareto efficient update of matching in school choiceCounting combinatorial choice rulesStable matchings and fixed points in trading networks: a noteManipulability in matching markets: conflict and coincidence of interestsTwo problems in max-size popular matchingsGross substitutability: an algorithmic surveyThe blocking lemma for a many-to-one matching modelOn the exhaustiveness of truncation and dropping strategies in many-to-many matching marketsThe substitutes condition and the lattice structure of the set of stable allocationsSchool choice with controlled choice constraints: hard bounds versus soft boundsConstitutions and groupsWARP and combinatorial choicePareto stability in two-sided many-to-many matching with weak preferencesOn the number of employed in the matching modelContracts versus salaries in matching: a general resultMany-to-one matching markets with externalities among firmsTesting substitutabilityOn the correspondence of contracts to salaries in (many-to-many) matchingComparative statics for size-dependent discounts in matching marketsTwo-sided micro-matching with technical progressA deferred acceptance algorithm with contractsEquivalent choice functions and stable mechanismsRationalizable choice functionsStable schedule matching under revealed preference.Implementation in the many-to-many matching market.Substitutes and stability for matching with contractsMarket structure and matching with contractsA many-to-many `rural hospital theorem'Existence of stable allocations in matching markets with infinite contracts: a topological approachAn algorithm to compute the full set of many-to-many stable matchings.A modified deferred acceptance algorithm for many-to-one matching markets with externalities among firmsComparative statics in matching marketsImplications of capacity reduction and entry in many-to-one stable matchingA new proof of the lattice structure of many-to-many pairwise-stable matchingsComparative statics in the multiple-partners assignment gameThe stable marriage problem: an interdisciplinary review from the physicist's perspectiveTwo-sided matching with incomplete information about others' preferencesEnvy-free matchings with lower quotasOn stable and strategy-proof rules in matching markets with contractsProbabilistic stable rules and Nash equilibrium in two-sided matching problemsOrdinal and cardinal solution concepts for two-sided matchingContract design and stability in many-to-many matchingThe blocking lemma and strategy-proofness in many-to-many matchingsUnilateral substitutability implies substitutable completability in many-to-one matching with contractsTime horizons, lattice structures, and welfare in multi-period matching marketsA college admissions clearinghouseMultilateral matchingNash implementation of competitive equilibria in the job-matching marketContracts vs. preferences over colleagues in matchingA foundation of location theory: existence of equilibrium, the welfare theorems, and coreThe singleton core in the college admissions problem and its application to the national resident matching program (NRMP)Applications of discrete convex analysis to mathematical economicsRestabilizing matching markets at senior levelNon-revelation mechanisms for many-to-many matching: equilibria versus stabilityStability and Nash implementation in matching markets with couplesOn the set of many-to-one strongly stable fractional matchingsThe college admissions problem with lower and common quotasImproving solution times for stable matching problems through preprocessingA modified deferred acceptance algorithm for conditionally lexicographic-substitutable preferencesA simple characterization of responsive choiceComputing Walrasian equilibria: fast algorithms and structural propertiesRefugee allocation in the setting of hedonic gamesCumulative offer process is order-independentSubstitutes and stability for many-to-many matching with contractsQuantile stable mechanismsStable bargained equilibria for assignment games without side paymentsStable many-to-many matchings with contractsMonotonicity and Nash implementation in matching markets with contractsNon-cooperative matching gamesA note on strategy-proofness from the doctor side in matching with contractsAgreement toward stability in matching marketsVerifiability and group formation in marketsMatching with contracts: calculation of the complete set of stable allocationsEfficiency and stability under substitutable priorities with tiesThree remarks on the many-to-many stable matching problemMisrepresentation and stability in the marriage problemBinary operations and lattice structure for a model of matching with contractsPower indices for networks, with applications to matching markets