Pages that link to "Item:Q2519488"
From MaRDI portal
The following pages link to Truthful approximation mechanisms for restricted combinatorial auctions (Q2519488):
Displaying 21 items.
- Approximate composable truthful mechanism design (Q344791) (← links)
- Combinatorial auctions without money (Q521808) (← links)
- Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
- Uniform price auctions: equilibria and efficiency (Q904682) (← links)
- Maximizing the minimum load for selfish agents (Q1041221) (← links)
- Market-based pricing in grids: on strategic manipulation and computational cost (Q1046122) (← links)
- Setting lower bounds on truthfulness (Q1651232) (← links)
- A universally-truthful approximation scheme for multi-unit auctions (Q1735729) (← links)
- Truthfulness with value-maximizing bidders: on the limits of approximation in combinatorial markets (Q1753496) (← links)
- Truthful mechanism design for bin packing with applications on cloud computing (Q2084605) (← links)
- Packing under convex quadratic constraints (Q2118134) (← links)
- Strategyproof auction mechanisms for network procurement (Q2215560) (← links)
- On social envy-freeness in multi-unit markets (Q2321269) (← links)
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach (Q2345944) (← links)
- Ex-post optimal knapsack procurement (Q2402058) (← links)
- Modularity and greed in double auctions (Q2411517) (← links)
- Limitations of VCG-based mechanisms (Q2454572) (← links)
- Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design (Q2672280) (← links)
- Single-Parameter Combinatorial Auctions with Partially Public Valuations (Q3162522) (← links)
- Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem (Q3196401) (← links)
- (Q5111230) (← links)
