Pages that link to "Item:Q449195"

The following pages link to Probabilistic assignment of objects: characterizing the serial rule (Q449195):

Displaying 33 items.

• Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization (Q462853) (← 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)
• Random assignment: redefining the serial rule (Q896952) (← 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)
• Upper-contour strategy-proofness in the probabilistic assignment problem (Q1986600) (← links)
• Tight social welfare approximation of probabilistic serial (Q2089061) (← links)
• Constrained random matching (Q2155237) (← 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)
• A graph theoretic approach to the slot allocation problem (Q2362198) (← links)
• New axioms for deferred acceptance (Q2397664) (← 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)
• The extended serial correspondence on a rich preference domain (Q2453497) (← links)
• Alternative characterizations of Boston mechanism (Q2637851) (← links)
• Axiomatic characterizations of the constrained probabilistic serial mechanism (Q6054914) (← links)
• Strategy-proof and envy-free mechanisms for house allocation (Q6090447) (← links)
• Bounded incentives in manipulating the probabilistic serial rule (Q6142601) (← 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)
• Some characterizations of generalized top trading cycles (Q6176732) (← links)
• The fractional Boston random assignment rule and its axiomatic characterization (Q6541989) (← links)
• On slots' scheduling (Q6559099) (← links)