The following pages link to (Q4471296):
Displaying 29 items.
- A general impossibility theorem and its application to individual rights (Q277315) (← links)
- Approximate composable truthful mechanism design (Q344791) (← links)
- Bounding the payment of approximate truthful mechanisms (Q476890) (← links)
- Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
- Truthful learning mechanisms for multi-slot sponsored search auctions with externalities (Q899160) (← links)
- A monotone approximation algorithm for scheduling with precedence constraints (Q935240) (← links)
- Walrasian equilibrium: Hardness, approximations and tractable instances (Q943867) (← links)
- Inapproximability results for combinatorial auctions with submodular utility functions (Q943868) (← links)
- Deterministic monotone algorithms for scheduling on related machines (Q952439) (← links)
- Truthful mechanisms for two-range-values variant of unrelated scheduling (Q1019737) (← links)
- A lower bound for scheduling mechanisms (Q1031874) (← links)
- Mechanism design for set cover games with selfish element agents (Q1041237) (← links)
- A universally-truthful approximation scheme for multi-unit auctions (Q1735729) (← links)
- On complexity of single-minded auction (Q1765304) (← links)
- Pricing lotteries (Q2253836) (← links)
- Combinatorial auctions with verification are tractable (Q2512655) (← links)
- Approximations and auctions for scheduling batches on related machines (Q2643820) (← 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)
- Spectrum Bidding in Wireless Networks and Related (Q3511367) (← links)
- Adaptive Incentive-Compatible Sponsored Search Auction (Q3599081) (← links)
- Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders (Q4997307) (← links)
- (Q5005149) (← links)
- (Q5111230) (← links)
- Preemptive Scheduling on Selfish Machines (Q5458506) (← links)
- Maximizing the Minimum Load for Selfish Agents (Q5458534) (← links)
- (Q5743441) (← links)
- (Q5743445) (← links)
- Truthful randomized mechanisms for combinatorial auctions (Q5891528) (← links)
