Pages that link to "Item:Q2453443"
From MaRDI portal
The following pages link to Probabilistic assignment of indivisible goods with single-peaked preferences (Q2453443):
Displaying 22 items.
- Assigning agents to a line (Q485809) (← links)
- When is the probabilistic serial assignment uniquely efficient and envy-free? (Q504391) (← links)
- Up methods in the allocation of indivisibilities when preferences are single-peaked (Q1001360) (← links)
- Consistent solutions to the problem of fair division when preferences are single-peaked (Q1332713) (← links)
- Probabilistic assignment: an extension approach (Q1649093) (← links)
- Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object (Q1680102) (← links)
- Computational aspects of assigning agents to a line (Q1680103) (← links)
- Impossibilities for probabilistic assignment (Q1697833) (← links)
- Strategy-proofness and essentially single-valued cores revisited (Q1757579) (← links)
- Probabilistic assignments of identical indivisible objects and uniform probabilistic rules (Q1880359) (← links)
- Random assignments of bundles (Q1985726) (← links)
- Upper-contour strategy-proofness in the probabilistic assignment problem (Q1986600) (← links)
- Random assignments on sequentially dichotomous domains (Q2173423) (← links)
- Fairness and efficiency in cake-cutting with single-peaked preferences (Q2180735) (← links)
- The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching (Q2291153) (← links)
- Notions of anonymity for object assignment: impossibility theorems (Q2299463) (← links)
- On the terminology of economic design: a critical assessment and some proposals (Q2318132) (← links)
- Random assignments on preference domains with a tier structure (Q2338670) (← links)
- A graph theoretic approach to the slot allocation problem (Q2362198) (← links)
- The extended serial correspondence on a rich preference domain (Q2453497) (← links)
- Binary mechanism for the allocation problem with single-dipped preferences (Q6168816) (← links)
- On slots' scheduling (Q6559099) (← links)
