Pages that link to "Item:Q4586003"
From MaRDI portal
The following pages link to Two axiomatic approaches to the probabilistic serial mechanism (Q4586003):
Displaying 50 items.
- Convex strategyproofness with an application to the probabilistic serial mechanism (Q284366) (← links)
- An equilibrium analysis of the probabilistic serial mechanism (Q328558) (← links)
- Probabilistic assignment of objects: characterizing the serial rule (Q449195) (← links)
- Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization (Q462853) (← links)
- An experimental study on the incentives of the probabilistic serial mechanism (Q485790) (← links)
- Assigning agents to a line (Q485809) (← links)
- A characterization of the extended serial correspondence (Q492874) (← links)
- When is the probabilistic serial assignment uniquely efficient and envy-free? (Q504391) (← links)
- Characterizations of the cumulative offer process (Q682475) (← links)
- A simple random assignment problem with a unique solution (Q699028) (← links)
- Random assignment: redefining the serial rule (Q896952) (← links)
- The probabilistic serial mechanism with private endowments (Q980972) (← links)
- Random assignment of multiple indivisible objects (Q1005770) (← links)
- The generalized random priority mechanism with budgets (Q1622384) (← links)
- Fair solutions to the random assignment problem (Q1633672) (← links)
- Probabilistic assignment: an extension approach (Q1649093) (← links)
- The object allocation problem with random priorities (Q1651226) (← links)
- On characterizations of the probabilistic serial mechanism involving incentive and invariance properties (Q1680097) (← links)
- Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object (Q1680102) (← links)
- Impossibilities for probabilistic assignment (Q1697833) (← links)
- A new ex-ante efficiency criterion and implications for the probabilistic serial mechanism (Q1753688) (← links)
- Size versus truncation robustness in the assignment problem (Q1985723) (← links)
- Upper-contour strategy-proofness in the probabilistic assignment problem (Q1986600) (← links)
- Partial strategyproofness: relaxing strategyproofness for the random assignment problem (Q1995295) (← links)
- Tight social welfare approximation of probabilistic serial (Q2089061) (← links)
- Constrained random matching (Q2155237) (← links)
- Extended random assignment mechanisms on a family of good sets (Q2241324) (← links)
- Short trading cycles: paired kidney exchange with strict ordinal preferences (Q2306268) (← links)
- Submodular optimization views on the random assignment problem (Q2330658) (← links)
- Efficient rules for probabilistic assignment (Q2338661) (← links)
- Size versus fairness in the assignment problem (Q2343388) (← links)
- Overlapping multiple object assignments (Q2358791) (← links)
- Fairness and efficiency in strategy-proof object allocation mechanisms (Q2359384) (← links)
- Efficient lottery design (Q2362194) (← links)
- Guaranteed size ratio of ordinally efficient and envy-free mechanisms in the assignment problem (Q2411514) (← links)
- The extended serial correspondence on a rich preference domain (Q2453497) (← links)
- Robust ex-post Pareto efficiency and fairness in random assignments: two impossibility results (Q2675456) (← links)
- Multi resource allocation with partial preferences (Q2680798) (← links)
- Strategy-proof allocation with outside option (Q2681500) (← links)
- Incentive properties for ordinal mechanisms (Q5964696) (← links)
- Axiomatic characterizations of the constrained probabilistic serial mechanism (Q6054914) (← links)
- Strategy-proof and envy-free mechanisms for house allocation (Q6090447) (← links)
- On wastefulness of random assignments in discrete allocation problems (Q6113818) (← links)
- A simple characterization of assignment mechanisms on set constraints (Q6155636) (← links)
- Ordinal Bayesian incentive compatibility in random assignment model (Q6156325) (← links)
- Strategy-proof and envy-free random assignment (Q6163283) (← links)
- Simultaneous eating algorithm and greedy algorithm in assignment problems (Q6176397) (← links)
- Some characterizations of generalized top trading cycles (Q6176732) (← links)
- A planner-optimal matching mechanism and its incentive compatibility in a restricted domain (Q6176744) (← links)
- The fractional Boston random assignment rule and its axiomatic characterization (Q6541989) (← links)
