A graph theoretic approach to the slot allocation problem (Q2362198): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2438505903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic assignment of objects: characterizing the serial rule / 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: Random Matching Under Dichotomous Preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assigning agents to a line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic assignment of indivisible goods with single-peaked preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solution to the random assignment problem on the full preference domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incentives in landing slot problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Indivisibles: An Analysis with Respect to Price Equilibrium and Fairness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random assignment under weak preferences / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:57, 14 July 2024

scientific article
Language Label Description Also known as
English
A graph theoretic approach to the slot allocation problem
scientific article

    Statements

    Identifiers