Pages that link to "Item:Q1303882"

The following pages link to Three remarks on the many-to-many stable matching problem (Q1303882):

Displaying 50 items.

• A branch-and-price algorithm for stable workforce assignments with hierarchical skills (Q322747) (← links)
• Modeling cooperative decision situations: the deviation function form and the equilibrium concept (Q328575) (← links)
• On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets (Q404743) (← links)
• A many-to-many `rural hospital theorem' (Q462856) (← links)
• On cooperative solutions of a generalized assignment game: limit theorems to the set of competitive equilibria (Q472191) (← links)
• A new proof of the lattice structure of many-to-many pairwise-stable matchings (Q489140) (← links)
• The stability of many-to-many matching with max-min preferences (Q500490) (← links)
• Probabilistic stable rules and Nash equilibrium in two-sided matching problems (Q521881) (← links)
• Contract design and stability in many-to-many matching (Q523005) (← links)
• The blocking lemma and strategy-proofness in many-to-many matchings (Q523460) (← links)
• Adjusting prices in the multiple-partners assignment game (Q532699) (← links)
• Stability property of matchings is a natural solution concept in coalitional market games (Q532732) (← links)
• The Pareto-stability concept is a natural solution concept for discrete matching markets with indifferences (Q637586) (← links)
• Unique stability in simple coalition formation games (Q705860) (← links)
• Decentralized college admissions under single application (Q826044) (← links)
• A generalized assignment game (Q854115) (← links)
• Friend of my friend: network formation with two-hop benefit (Q904688) (← links)
• On Marilda Sotomayor's extraordinary contribution to matching theory (Q908176) (← links)
• A deferred acceptance algorithm with contracts (Q908183) (← links)
• Finding all stable matchings with couples (Q908185) (← links)
• Dynamic club formation with coordination (Q908188) (← links)
• Stable many-to-many matchings with contracts (Q1030169) (← links)
• Stable schedule matching under revealed preference. (Q1414616) (← links)
• Implementation in the many-to-many matching market. (Q1420524) (← links)
• An algorithm to compute the full set of many-to-many stable matchings. (Q1431789) (← links)
• Constitutions and groups (Q1691356) (← links)
• Equivalences between two matching models: stability (Q1714490) (← links)
• Comparative statics in the multiple-partners assignment game (Q1735807) (← links)
• The lattice of envy-free matchings (Q1753285) (← links)
• Applications of discrete convex analysis to mathematical economics (Q1769600) (← links)
• Two-sided strategy-proofness in many-to-many matching markets (Q2021788) (← links)
• Matching with contracts: calculation of the complete set of stable allocations (Q2081899) (← links)
• Power indices for networks, with applications to matching markets (Q2106759) (← links)
• Some remarks on the modeling of discrete matching markets (Q2121461) (← links)
• Matching and scheduling of student-company-talks for a university it-speed dating event (Q2167666) (← links)
• Stability and venture structures in multilateral matching (Q2231380) (← links)
• The stable marriage problem: an interdisciplinary review from the physicist's perspective (Q2231919) (← links)
• An enhanced approach for two-sided matching with 2-tuple linguistic multi-attribute preference (Q2318614) (← links)
• Efficiency and stability under substitutable priorities with ties (Q2334139) (← links)
• An improved algorithm for testing substitutability of weak preferences (Q2334856) (← links)
• Connecting the cooperative and competitive structures of the multiple-partners assignment game (Q2373771) (← links)
• Two problems in max-size popular matchings (Q2415362) (← links)
• Many-to-one matching markets with externalities among firms (Q2427870) (← links)
• The communication requirements of social choice rules and supporting budget sets (Q2455666) (← links)
• Random paths to pairwise stability in many-to-many matching problems: a study on market equilibration (Q2482665) (← links)
• The stability of the equilibrium outcomes in the admission games induced by stable matching rules (Q2482680) (← links)
• A general two-sided matching market with discrete concave utility functions (Q2492196) (← links)
• Credible group stability in many-to-many matching problems (Q2496782) (← links)
• Testing substitutability of weak preferences (Q2637415) (← links)
• Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem (Q2815443) (← links)