Pages that link to "Item:Q5891931"
From MaRDI portal
The following pages link to Truthful randomized mechanisms for combinatorial auctions (Q5891931):
Displayed 25 items.
- Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
- Improved lower bounds for non-utilitarian truthfulness (Q627119) (← links)
- The balloon popping problem revisited: lower and upper bounds (Q647488) (← links)
- Auction design with costly preference elicitation (Q812389) (← links)
- Inapproximability results for combinatorial auctions with submodular utility functions (Q943868) (← links)
- Truthful mechanisms for two-range-values variant of unrelated scheduling (Q1019737) (← links)
- A lower bound for scheduling mechanisms (Q1031874) (← links)
- Efficiency and budget balance in general quasi-linear domains (Q1735779) (← links)
- Incentive compatible regression learning (Q1959425) (← links)
- Pricing lotteries (Q2253836) (← links)
- Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions (Q2280688) (← links)
- Optimization with demand oracles (Q2414860) (← links)
- Combinatorial auctions with verification are tractable (Q2512655) (← links)
- Limitations of randomized mechanisms for combinatorial auctions (Q2516249) (← links)
- Truthful approximation mechanisms for restricted combinatorial auctions (Q2519488) (← links)
- Efficiency and Budget Balance (Q2959843) (← links)
- Responsive Lotteries (Q3162515) (← links)
- Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs (Q3304731) (← links)
- Optimal Impartial Selection (Q3449559) (← links)
- Combinatorial Walrasian Equilibrium (Q3460334) (← links)
- Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
- Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders (Q4997307) (← links)
- Improved Lower Bounds for Non-utilitarian Truthfulness (Q5443369) (← links)
- (Q5743441) (← links)
- (Q5743502) (← links)