The blocking lemma and strategy-proofness in many-to-many matchings (Q523460): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.geb.2016.10.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2551090796 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q124838431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On preferences over subsets and the lattice structure of stable matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voting by Committees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machiavelli and the Gale-Shapley Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of matchings when individuals have preferences over colleagues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: College Admissions and the Stability of Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the stable matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group incentive compatibility for matching with contracts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Substitutes and stability for matching with contracts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many matching with max-min preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stability of many-to-many matching with max-min preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Matching, Coalition Formation, and Gross Substitutes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable many-to-many matchings with contracts / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Can Manipulations be Avoided in Two-Sided Matching Markets? -- Maximal Domain Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single agents and the set of many-to-one stable matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the lattice structure of the set of stable matchings for a many-to-one model<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On group strategy-proof mechanisms for a many-to-one matching model / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to compute the full set of many-to-many stable matchings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The blocking lemma for a many-to-one matching model / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Economics of Matching: Stability and Incentives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability and Polarization of Interests in Job Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The college admissions problem is not equivalent to the marriage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three remarks on the many-to-many stable matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation in the many-to-many matching market. / rank
 
Normal rank

Latest revision as of 17:45, 13 July 2024

scientific article
Language Label Description Also known as
English
The blocking lemma and strategy-proofness in many-to-many matchings
scientific article

    Statements

    The blocking lemma and strategy-proofness in many-to-many matchings (English)
    0 references
    0 references
    0 references
    21 April 2017
    0 references
    0 references
    many-to-many matching
    0 references
    blocking lemma
    0 references
    max-min preferences
    0 references
    deferred acceptance algorithm
    0 references
    strategy-proofness
    0 references
    0 references
    0 references
    0 references
    0 references