Pages that link to "Item:Q1961975"

The following pages link to The lattice structure of the set of stable outcomes of the multiple partners assignment game (Q1961975):

Displaying 32 items.

• On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets (Q404743) (← links)
• On cooperative solutions of a generalized assignment game: limit theorems to the set of competitive equilibria (Q472191) (← links)
• Stability and competitive equilibria in multi-unit trading networks with discrete concave utility functions (Q495853) (← 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)
• Core of the assignment game via fixed point methods (Q533916) (← links)
• Market power in bilateral oligopoly markets with non-expandable infrastructures (Q776855) (← links)
• A generalized assignment game (Q854115) (← links)
• On Marilda Sotomayor's extraordinary contribution to matching theory (Q908176) (← links)
• A survey on assignment markets (Q908179) (← 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)
• A note on the multiple partners assignment game (Q990277) (← links)
• Three remarks on the many-to-many stable matching problem (Q1303882) (← links)
• An algorithm to compute the full set of many-to-many stable matchings. (Q1431789) (← links)
• The stable fixtures problem with payments (Q1651275) (← links)
• Shapley's conjecture on the cores of abstract market games (Q1651297) (← links)
• On the manipulability of competitive equilibrium rules in many-to-many buyer-seller markets (Q1684134) (← links)
• Comparative statics in the multiple-partners assignment game (Q1735807) (← links)
• Time horizons, lattice structures, and welfare in multi-period matching markets (Q1756324) (← links)
• Applications of discrete convex analysis to mathematical economics (Q1769600) (← links)
• An algorithm for identifying fair and optimal allocations (Q1934132) (← links)
• The multiple-partners assignment game with heterogeneous sales and multi-unit demands: competitive equilibria (Q1935950) (← links)
• Axioms for the optimal stable rules and fair-division rules in a multiple-partners job market (Q2100655) (← links)
• Does it make sense to analyse a two-sided market as a multi-choice game? (Q2241239) (← links)
• Competition and cooperation in a two-sided matching market with replication (Q2324835) (← links)
• On the structure of cooperative and competitive solutions for a generalized assignment game (Q2336206) (← links)
• Polynomial time algorithm for an optimal stable assignment with multiple partners (Q2373720) (← links)
• Connecting the cooperative and competitive structures of the multiple-partners assignment game (Q2373771) (← links)
• A general two-sided matching market with discrete concave utility functions (Q2492196) (← links)
• Transfers and exchange-stability in two-sided matching problems (Q2629324) (← links)
• Two-Sided Matching Models (Q5150290) (← links)
• An incentive compatible, efficient market for air traffic flow management (Q5918109) (← links)