Probabilistic assignment: an extension approach
From MaRDI portal
Recommendations
- A Probabilistic Approach to Solving Assignment Problems
- Probabilistic analysis of the generalised assignment problem
- Efficient rules for probabilistic assignment
- Extensions of the sequential stochastic assignment problem
- The Probabilistic Analysis of a Heuristic for the Assignment Problem
- scientific article; zbMATH DE number 1802784
- Consistency in the probabilistic assignment model
- Impossibilities for probabilistic assignment
Cites work
- scientific article; zbMATH DE number 1878575 (Why is no real title available?)
- scientific article; zbMATH DE number 3277166 (Why is no real title available?)
- scientific article; zbMATH DE number 3078983 (Why is no real title available?)
- scientific article; zbMATH DE number 3095897 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- A new solution to the random assignment problem.
- A note on object allocation under lexicographic preferences
- A solution to the random assignment problem on the full preference domain
- A sufficient condition for the equivalence of strategy-proofness and nonmanipulability by preferences adjacent to the sincere one
- Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
- Equivalence of efficiency notions for ordinal assignment problems
- Incentive properties for ordinal mechanisms
- Incentives in the probabilistic serial mechanism
- Manipulation of Schemes that Mix Voting with Chance
- On a conjecture by Gale about one-sided matching problems
- Probabilistic assignment of indivisible goods with single-peaked preferences
- Probabilistic assignment of objects: characterizing the serial rule
- Random assignment of multiple indivisible objects
- Random assignment under weak preferences
- Random assignment: redefining the serial rule
- Risk Aversion in the Small and in the Large
- Risk aversion and risk vulnerability in the continuous and discrete case
- The probabilistic serial mechanism with private endowments
- Two axiomatic approaches to the probabilistic serial mechanism
- When is the probabilistic serial assignment uniquely efficient and envy-free?
- Why do popular mechanisms lack efficiency in random environments?
Cited in
(13)- The extended serial correspondence on a rich preference domain
- Ordinal Bayesian incentive compatibility in random assignment model
- Upper-contour strategy-proofness in the probabilistic assignment problem
- The object allocation problem with random priorities
- A modified deferred acceptance algorithm for conditionally lexicographic-substitutable preferences
- Random assignment: redefining the serial rule
- A Probabilistic Approach to Solving Assignment Problems
- Partial strategyproofness: relaxing strategyproofness for the random assignment problem
- Extended random assignment mechanisms on a family of good sets
- Efficient rules for probabilistic assignment
- On rank dominance of tie‐breaking rules
- The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching
- Random assignments on preference domains with a tier structure
This page was built for publication: Probabilistic assignment: an extension approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1649093)
