Pages that link to "Item:Q1876659"

The following pages link to Core many-to-one matchings by fixed-point methods (Q1876659):

Displaying 41 items.

• Core of the assignment game via fixed point methods (Q533916) (← links)
• On the invariance of the set of core matchings with respect to preference profiles (Q765218) (← links)
• Agreement toward stability in matching markets (Q766251) (← links)
• A cumulative offer process for supply chain networks (Q826047) (← links)
• Contracts versus salaries in matching: a general result (Q900445) (← links)
• Core of coalition formation games and fixed-point methods (Q904830) (← links)
• Finding all stable matchings with couples (Q908185) (← links)
• Why do stable clearinghouses work so well? -- Small sets of stable matchings in typical environments, and the limits-on-manipulation theorem of Demange, Gale and Sotomayor (Q908186) (← links)
• On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering (Q1637226) (← links)
• Lone wolves in infinite, discrete matching markets (Q1651278) (← links)
• A top dog tale with preference complementarities (Q1652838) (← links)
• Stable matchings and fixed points in trading networks: a note (Q1673527) (← links)
• Paths to stability for college admissions with budget constraints (Q1677256) (← links)
• Equivalences between two matching models: stability (Q1714490) (← links)
• The lattice of envy-free matchings (Q1753285) (← links)
• Substitutes and stability for matching with contracts (Q1958950) (← links)
• Binary operations for the lattice structure in a many-to-many matching model (Q2033997) (← links)
• Lattice structure of the random stable set in many-to-many matching markets (Q2078071) (← links)
• The stable marriage problem: an interdisciplinary review from the physicist's perspective (Q2231919) (← links)
• A solution to matching with preferences over colleagues (Q2371150) (← links)
• Von Neumann-Morgenstern stable sets in matching problems (Q2373788) (← links)
• Many-to-one matching markets with externalities among firms (Q2427870) (← links)
• Hedonic games related to many-to-one matching problems (Q2450143) (← links)
• A modified deferred acceptance algorithm for many-to-one matching markets with externalities among firms (Q2452230) (← links)
• Characterization of the core in full domain marriage problems (Q2453826) (← links)
• Stable schedule matchings (Q2454577) (← links)
• Welfare and stability in senior matching markets (Q2482669) (← links)
• Deferred acceptance algorithms: history, theory, practice, and open questions (Q2482681) (← links)
• Monotonicity and consistency in matching markets (Q2491082) (← links)
• Credible group stability in many-to-many matching problems (Q2496782) (← links)
• The lattice of worker-quasi-stable matchings (Q2675448) (← links)
• Competitive Equilibria for Non-quasilinear Bidders in Combinatorial Auctions (Q2959823) (← links)
• The Lattice of Core (Sub)Matchings in a Two-Sided Matching Market (Q4316547) (← links)
• On Lattice and DA (Q4606763) (← links)
• Deferred Acceptance with Compensation Chains (Q4994168) (← links)
• Two-Sided Matching Models (Q5150290) (← links)
• Stable Matching in Large Economies (Q5225243) (← links)
• The core of many-to-one matching games with peer effect (Q5368254) (← links)
• Stable matching: An integer programming approach (Q6053647) (← links)
• The lattice of envy-free many-to-many matchings with contracts (Q6145086) (← links)
• Stable allocations in discrete exchange economies (Q6664582) (← links)