Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems (Q844925): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Manipulation of Social Choice Mechanisms that Do Not Leave "Too Much" to Chance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy-proof social choice correspondences. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identical preferences lower bound solution and consistency in economies with indivisible goods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the extension of preferences over a set to the power set: An axiomatic characterization of a quasi-ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: An alternative characterization of the uniform rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-valued strategy-proof social choice rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pessimistic approach to the queueing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: No-envy in queueing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategic manipulability without resoluteness or shared beliefs: Gibbard-Satterthwaite generalized / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manipulation and the Pareto rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-chance lotteries in social choice theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manipulation of social choice functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3204946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incentives in Teams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groves' Scheme on Restricted Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the extension of an order on a set to the power set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy-Proofness and Social Choice Functions without Singlevaluedness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the Shapley value in queueing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient strategy-proof allocation functions in linear production economies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanism design in queueing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achieving the first best in sequencing problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions / 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

Latest revision as of 11:15, 2 July 2024

scientific article
Language Label Description Also known as
English
Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
scientific article

    Statements

    Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems (English)
    0 references
    0 references
    0 references
    5 February 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    queueing problems
    0 references
    efficiency
    0 references
    fairness
    0 references
    strategy-proofness
    0 references
    0 references
    0 references
    0 references
    0 references