A characterization of the Vickrey rule in slot allocation problems
From MaRDI portal
Publication:6074886
Recommendations
- Equity and the Vickrey allocation rule on general preference domains
- Vickrey allocation rule with income effect
- Characterizing Vickrey allocation rule by anonymity
- Efficiency and strategy-proofness in multi-unit object allocation problems with non-quasi-linear preferences: a positive result
- Characterizing the Vickrey combinatorial auction by induction
Cites work
- A characterization of the symmetrically balanced VCG rule in the queueing problem
- A graph theoretic approach to the slot allocation problem
- Assigning agents to a line
- Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
- Characterizing Vickrey allocation rule by anonymity
- Characterizing the Vickrey combinatorial auction by induction
- Egalitarian equivalence and strategyproofness in the queueing problem
- Egalitarian-equivalent Groves mechanisms in the allocation of heterogeneous objects
- Fair queueing
- Groves' Scheme on Restricted Domains
- Incentives in Teams
- No-envy, solidarity, and strategy-proofness in the queueing problem
- Second price auctions on general preference domains: two characterizations
- Strategy-proofness and efficiency for non-quasi-linear and common-tiered-object preferences: characterization of minimum price rule
- Strategy-proofness and efficiency with non-quasi-linear preferences: a characterization of minimum price Walrasian rule
- Vickrey allocation rule with income effect
This page was built for publication: A characterization of the Vickrey rule in slot allocation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074886)