Pages that link to "Item:Q1005770"
From MaRDI portal
The following pages link to Random assignment of multiple indivisible objects (Q1005770):
Displaying 44 items.
- Assignment problems with complementarities (Q308621) (← links)
- An equilibrium analysis of the probabilistic serial mechanism (Q328558) (← links)
- Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization (Q462853) (← links)
- When is the probabilistic serial assignment uniquely efficient and envy-free? (Q504391) (← links)
- Why do popular mechanisms lack efficiency in random environments? (Q840694) (← links)
- Incentives in the probabilistic serial mechanism (Q848608) (← links)
- A solution to the random assignment problem on the full preference domain (Q860356) (← links)
- Social orderings for the assignment of indivisible objects (Q960253) (← links)
- The probabilistic serial mechanism with private endowments (Q980972) (← links)
- The generalized random priority mechanism with budgets (Q1622384) (← links)
- Envy-free and budget-balanced assignment of identical objects (Q1638035) (← 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)
- Efficient and fair assignment mechanisms are strongly group manipulable (Q1729671) (← links)
- Matching with indifferences: a comparison of algorithms in the context of course allocation (Q1753433) (← links)
- Incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences (Q1786741) (← links)
- A new fairness notion in the assignment of indivisible resources (Q2108757) (← links)
- Constrained random matching (Q2155237) (← links)
- Multi-unit assignment under dichotomous preferences (Q2173167) (← links)
- Random assignments on sequentially dichotomous domains (Q2173423) (← links)
- Extended random assignment mechanisms on a family of good sets (Q2241324) (← links)
- An impossibility result for housing markets with fractional endowments (Q2294218) (← links)
- Short trading cycles: paired kidney exchange with strict ordinal preferences (Q2306268) (← links)
- Submodular optimization views on the random assignment problem (Q2330658) (← 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)
- Implementation in stochastic dominance Nash equilibria (Q2362193) (← links)
- Efficient lottery design (Q2362194) (← links)
- Strategy-proof assignment on the full preference domain (Q2386134) (← links)
- Guaranteed size ratio of ordinally efficient and envy-free mechanisms in the assignment problem (Q2411514) (← links)
- A note on object allocation under lexicographic preferences (Q2441234) (← links)
- A general equivalence theorem for allocation of indivisible objects (Q2444698) (← links)
- Probabilistic assignment of indivisible goods with single-peaked preferences (Q2453443) (← links)
- Double implementation in a market for indivisible goods with a price constraint (Q2483121) (← links)
- The vigilant eating rule: a general approach for probabilistic economic design with constraints (Q2675446) (← links)
- Multi resource allocation with partial preferences (Q2680798) (← links)
- Assignment Mechanisms Under Distributional Constraints (Q5131470) (← links)
- Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms (Q5881800) (← links)
- Strategy-proof and envy-free random assignment (Q6163283) (← links)
- A theory of fair random allocation under priorities (Q6631809) (← links)