Pages that link to "Item:Q2568836"
From MaRDI portal
The following pages link to Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems (Q2568836):
Displaying 43 items.
- Responsive affirmative action in school choice (Q308606) (← links)
- Assignment problems with complementarities (Q308621) (← links)
- The blocking lemma and group incentive compatibility for matching with contracts (Q309845) (← links)
- The blocking lemma and strategy-proofness in many-to-many matchings (Q523460) (← links)
- The blocking lemma for a many-to-one matching model (Q617603) (← links)
- Secure implementation in Shapley-Scarf housing markets (Q639889) (← links)
- Cardinal Bayesian allocation mechanisms without transfers (Q665457) (← links)
- Strategy-proofness and identical preferences lower bound in allocation problem of indivisible objects (Q722621) (← links)
- When too little is as good as nothing at all: rationing a disposable good among satiable people with acceptance thresholds (Q765217) (← links)
- Pairwise kidney exchange (Q813943) (← links)
- Strategy-proof, efficient, and nonbossy quota allocations (Q836935) (← links)
- Manipulation via endowments in exchange markets with indivisible goods (Q866940) (← links)
- Exchange in a general market with indivisible goods (Q869861) (← links)
- Centralized allocation in multiple markets (Q898664) (← links)
- Strategy-proof assignment of multiple resources (Q900413) (← links)
- Random assignment of multiple indivisible objects (Q1005770) (← links)
- Strategy-proofness, solidarity, and consistency for multiple assignment problems (Q1414412) (← links)
- Truthfulness in advertising? Approximation mechanisms for knapsack bidders (Q1651735) (← links)
- Strategy-proofness of scoring allocation correspondences for indivisible goods (Q1707112) (← links)
- Truthfulness with value-maximizing bidders: on the limits of approximation in combinatorial markets (Q1753496) (← links)
- Two-sided strategy-proofness in many-to-many matching markets (Q2021788) (← links)
- A modified deferred acceptance algorithm for conditionally lexicographic-substitutable preferences (Q2034808) (← links)
- Resource allocation on the basis of priorities under multi-unit demand (Q2036905) (← links)
- Strategy-proof popular mechanisms (Q2092775) (← links)
- Serial rules in a multi-unit Shapley-Scarf market (Q2100651) (← links)
- Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness (Q2152111) (← links)
- Multi-unit assignment under dichotomous preferences (Q2173167) (← links)
- Monotonic core allocation paths for assignment games (Q2296028) (← links)
- Borda-induced hedonic games with friends, enemies, and neutral players (Q2317997) (← links)
- Overlapping multiple object assignments (Q2358791) (← links)
- House allocation with existing tenants: an equivalence (Q2387316) (← links)
- Efficient resource allocation under multi-unit demand (Q2437801) (← links)
- Group strategyproof cost sharing: the role of indifferences (Q2437817) (← links)
- Matching with quorums (Q2440142) (← links)
- A characterization of the uniform rule with several commodities and agents (Q2452129) (← links)
- Fair allocation of indivisible goods: the two-agent case (Q2453428) (← links)
- Characterizations of the sequential priority rules in the assignment of object types (Q2513285) (← links)
- Multi resource allocation with partial preferences (Q2680798) (← links)
- Optimization-based Mechanisms for the Course Allocation Problem (Q3386789) (← links)
- Preference revelation games and strict cores of multiple‐type housing market problems (Q6074889) (← links)
- Strategy‐proof and group strategy‐proof stable mechanisms: An equivalence (Q6077637) (← links)
- Outside options in neutral allocation of discrete resources (Q6156321) (← links)
- A theory of fair random allocation under priorities (Q6631809) (← links)