Pages that link to "Item:Q1338546"

The following pages link to Queue allocation of indivisible goods (Q1338546):

Displaying 39 items.

• Transferring ownership of public housing to existing tenants: a market design approach (Q308656) (← links)
• Top trading with fixed tie-breaking in markets with indivisible goods (Q402062) (← links)
• Parametrized algorithms for random serial dictatorship (Q477775) (← links)
• Pareto optimal matchings in many-to-many markets with ties (Q506537) (← links)
• Counting houses of Pareto optimal matchings in the house allocation problem (Q738845) (← links)
• Pairwise kidney exchange (Q813943) (← links)
• Games of capacity allocation in many-to-one matching with an aftermarket (Q836923) (← links)
• Strategy-proof voting on the full preference domain (Q859595) (← links)
• A solution to the random assignment problem on the full preference domain (Q860356) (← links)
• Weakly fair allocations and strategy-proofness (Q926330) (← links)
• Random assignment under weak preferences (Q1021614) (← links)
• A tale of two mechanisms: Student placement (Q1283855) (← links)
• Pareto optimal matchings of students to courses in the presence of prerequisites (Q1662656) (← links)
• A complete characterization of hierarchy (Q1667900) (← links)
• Stable and efficient resource allocation under weak priorities (Q1691346) (← links)
• Sequential rules for house allocation with price restrictions (Q1691348) (← links)
• Impossibilities for probabilistic assignment (Q1697833) (← links)
• A note on the assignment problem with uniform preferences (Q1785360) (← links)
• Incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences (Q1786741) (← links)
• Strategy-proofness and population-monotonicity for house allocation problems (Q1867775) (← links)
• Serial dictatorship mechanisms with reservation prices: heterogeneous objects (Q2058845) (← links)
• A new allocation rule for the housing market problem with ties (Q2075459) (← links)
• Strategy-proof popular mechanisms (Q2092775) (← links)
• On stable and efficient mechanisms for priority-based allocation problems (Q2173093) (← links)
• Pareto-optimal assignments by hierarchical exchange (Q2247951) (← links)
• Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity (Q2289006) (← links)
• Size versus truthfulness in the house allocation problem (Q2319628) (← links)
• Overlapping multiple object assignments (Q2358791) (← links)
• Strategy-proof assignment on the full preference domain (Q2386134) (← links)
• House allocation with existing tenants: an equivalence (Q2387316) (← links)
• Pareto optimal matchings with lower quotas (Q2409711) (← links)
• Games of capacity manipulation in hospital-intern markets (Q2431839) (← links)
• Reclaim-proof allocation of indivisible objects (Q2436293) (← links)
• The computational complexity of random serial dictatorship (Q2453028) (← links)
• The vigilant eating rule: a general approach for probabilistic economic design with constraints (Q2675446) (← links)
• Pareto Optimal Matchings in Many-to-Many Markets with Ties (Q3449579) (← links)
• Strategy-proof and envy-free mechanisms for house allocation (Q6090447) (← links)
• Outside options in neutral allocation of discrete resources (Q6156321) (← links)
• A simple matching domain with indifferences and a master list (Q6156344) (← links)