Two axiomatic approaches to the probabilistic serial mechanism
From MaRDI portal
Publication:4586003
Recommendations
- Axiomatic characterizations of the constrained probabilistic serial mechanism
- An equilibrium analysis of the probabilistic serial mechanism
- A note on two-way probabilistic automata
- Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
- Axiomatizations for probabilistic finite-state behaviors
- Foundations of Software Science and Computational Structures
- scientific article; zbMATH DE number 1754605
- A cardinal approach to straightforward probabilistic mechanisms
- Axioms for a Class of Algorithms of Sequential Decision Making
- Convex strategyproofness with an application to the probabilistic serial mechanism
Cited in
(54)- Size versus truncation robustness in the assignment problem
- On slots' scheduling
- Guaranteed size ratio of ordinally efficient and envy-free mechanisms in the assignment problem
- Convex strategyproofness with an application to the probabilistic serial mechanism
- Axiomatic characterizations of the constrained probabilistic serial mechanism
- Robust ex-post Pareto efficiency and fairness in random assignments: two impossibility results
- A planner-optimal matching mechanism and its incentive compatibility in a restricted domain
- Efficient lottery design
- A simple characterization of assignment mechanisms on set constraints
- Short trading cycles: paired kidney exchange with strict ordinal preferences
- Extended random assignment mechanisms on a family of good sets
- Submodular optimization views on the random assignment problem
- Multi resource allocation with partial preferences
- Upper-contour strategy-proofness in the probabilistic assignment problem
- A new ex-ante efficiency criterion and implications for the probabilistic serial mechanism
- Overlapping multiple object assignments
- Ordinal Bayesian incentive compatibility in random assignment model
- Probabilistic assignment of objects: characterizing the serial rule
- Simultaneous eating algorithm and greedy algorithm in assignment problems
- Probabilistic assignment: an extension approach
- The object allocation problem with random priorities
- Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object
- Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization
- A characterization of the extended serial correspondence
- An equilibrium analysis of the probabilistic serial mechanism
- Constrained random matching
- Random assignment of multiple indivisible objects
- An experimental study on the incentives of the probabilistic serial mechanism
- Partial strategyproofness: relaxing strategyproofness for the random assignment problem
- A simple random assignment problem with a unique solution
- A theory of fair random allocation under priorities
- Efficient rules for probabilistic assignment
- Fair solutions to the random assignment problem
- The probabilistic serial mechanism with private endowments
- Assigning agents to a line
- On wastefulness of random assignments in discrete allocation problems
- The generalized random priority mechanism with budgets
- Strategy-proof and envy-free random assignment
- On characterizations of the probabilistic serial mechanism involving incentive and invariance properties
- Strategy-proof allocation with outside option
- When is the probabilistic serial assignment uniquely efficient and envy-free?
- Fairness and efficiency in strategy-proof object allocation mechanisms
- Characterizing a probabilistic version of the Boston mechanism under weak priorities
- Ex ante and ex post envy-freeness on polytope resources
- Size versus fairness in the assignment problem
- Random assignment: redefining the serial rule
- Some characterizations of generalized top trading cycles
- Incentive properties for ordinal mechanisms
- Characterizations of the cumulative offer process
- Strategy-proof and envy-free mechanisms for house allocation
- Tight social welfare approximation of probabilistic serial
- The fractional Boston random assignment rule and its axiomatic characterization
- Impossibilities for probabilistic assignment
- The extended serial correspondence on a rich preference domain
This page was built for publication: Two axiomatic approaches to the probabilistic serial mechanism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4586003)
