Pages that link to "Item:Q836935"

The following pages link to Strategy-proof, efficient, and nonbossy quota allocations (Q836935):

Displaying 50 items.

• On revenue maximization with sharp multi-unit demands (Q266046) (← links)
• Assignment problems with complementarities (Q308621) (← links)
• Resource allocation mechanisms based on strategy-proof symmetrical anonymous voting procedures with delegation (Q386935) (← links)
• Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization (Q462853) (← links)
• Representing a sequential allotment rule in the form of a strategy-proof mechanism of multicriteria active expertise (Q463398) (← links)
• On the operation of multiple matching markets (Q516981) (← links)
• Non-bossiness (Q682486) (← links)
• Multi-unit auctions with budget limits (Q765207) (← links)
• When too little is as good as nothing at all: rationing a disposable good among satiable people with acceptance thresholds (Q765217) (← links)
• Influence in private-goods allocation (Q776963) (← links)
• Centralized allocation in multiple markets (Q898664) (← links)
• Queue allocation of indivisible goods (Q1338546) (← links)
• Truthfulness in advertising? Approximation mechanisms for knapsack bidders (Q1651735) (← links)
• Groupstrategyproofness of the egalitarian mechanism for constrained rationing problems (Q1680106) (← links)
• Eliciting the socially optimal allocation from responsible agents (Q1680147) (← links)
• Impossibilities for probabilistic assignment (Q1697833) (← 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)
• A modified deferred acceptance algorithm for conditionally lexicographic-substitutable preferences (Q2034808) (← links)
• Strategy-proof popular mechanisms (Q2092775) (← links)
• Serial rules in a multi-unit Shapley-Scarf market (Q2100651) (← links)
• Non-dictatorial public distribution rules (Q2149190) (← links)
• Serial dictatorship mechanisms with reservation prices (Q2206002) (← links)
• Efficient and strategy-proof allocation mechanisms in many-agent economies (Q2217367) (← links)
• Swap-flexibility in the assignment of houses (Q2222205) (← links)
• A mechanism design approach to allocating central government funds among regional development agencies (Q2254237) (← links)
• Notions of anonymity for object assignment: impossibility theorems (Q2299463) (← links)
• Borda-induced hedonic games with friends, enemies, and neutral players (Q2317997) (← links)
• Overlapping multiple object assignments (Q2358791) (← links)
• Strategy-proof assignment on the full preference domain (Q2386134) (← links)
• Strategyproof single unit award rules (Q2388828) (← links)
• Strategy-proof Pareto-improvement (Q2415985) (← links)
• A task-allocation problem (Q2425161) (← links)
• Efficient resource allocation under multi-unit demand (Q2437801) (← links)
• Matching with quorums (Q2440142) (← links)
• A general equivalence theorem for allocation of indivisible objects (Q2444698) (← links)
• Constrained-optimal strategy-proof assignment: beyond the Groves mechanisms (Q2447059) (← links)
• A characterization of the uniform rule with several commodities and agents (Q2452129) (← links)
• Collective choice under dichotomous preferences (Q2485952) (← links)
• Efficient and stable collective choices under gregarious preferences (Q2519487) (← links)
• Multi resource allocation with partial preferences (Q2680798) (← links)
• Dictatorial mechanisms in constrained combinatorial auctions (Q2867515) (← links)
• Optimization-based Mechanisms for the Course Allocation Problem (Q3386789) (← links)
• Autocratic Mechanisms: A Form of Dictatorship in Constrained Combinatorial Auctions (Q3459303) (← links)
• THE PROPORTIONAL LOTTERY PROTOCOL IS STRONGLY β-PARTICIPATORY AND VNM-STRATEGY-PROOF (Q3606363) (← links)
• Ordinal Maximin Share Approximation for Goods (Q5094017) (← links)
• Characterizing incentive compatible, Pareto optimal and sufficiently anonymous constrained combinatorial mechanisms – Two players case (Q5283446) (← links)
• All sequential allotment rules are obviously strategy‐proof (Q6076917) (← links)
• Outside options in neutral allocation of discrete resources (Q6156321) (← links)
• A theory of simplicity in games and mechanism design (Q6536583) (← links)