Matching with indifferences: a comparison of algorithms in the context of course allocation (Q1753433): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2016.12.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2560667248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Popular Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exchange of indivisible goods and indifferences: the top trading absorbing sets mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new solution to the random assignment problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto Optimal Matchings in Many-to-Many Markets with Ties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-sided matching with indifferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Resource Allocation on the Basis of Priorities / 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: Manipulation of Voting Schemes: A General Result / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manipulation of Schemes that Mix Voting with Chance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding large stable matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The difference indifference makes in strategy-proof allocation of objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: School Choice with Consent<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time local approximation algorithm for maximum stable marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random assignment of multiple indivisible objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Profile-Based Optimal Matchings in the Student/Project Allocation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Dominance and Expected Utility: Survey and Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmics of Matching Under Preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard variants of stable marriage. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Popular Matchings in the Capacitated House Allocation Problem / 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: Deferred acceptance algorithms: history, theory, practice, and open questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of stable matchings as extreme points of a polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cores and indivisibility / rank
 
Normal rank

Latest revision as of 17:12, 15 July 2024

scientific article
Language Label Description Also known as
English
Matching with indifferences: a comparison of algorithms in the context of course allocation
scientific article

    Statements

    Matching with indifferences: a comparison of algorithms in the context of course allocation (English)
    0 references
    0 references
    0 references
    29 May 2018
    0 references
    decision support management
    0 references
    matching under preferences
    0 references
    course assignment
    0 references
    strategy-proofness
    0 references
    Pareto efficiency
    0 references
    0 references
    0 references

    Identifiers