Pages that link to "Item:Q682470"
From MaRDI portal
The following pages link to Pareto-optimal matching allocation mechanisms for boundedly rational agents (Q682470):
Displaying 6 items.
- Designing matching mechanisms under constraints: an approach from discrete convex analysis (Q1757595) (← links)
- The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching (Q2291153) (← links)
- Priority Design in Centralized Matching Markets (Q5090028) (← links)
- Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation (Q5278269) (← links)
- A simple model of two-stage choice (Q5963305) (← links)
- A planner-optimal matching mechanism and its incentive compatibility in a restricted domain (Q6176744) (← links)