Pages that link to "Item:Q943868"

The following pages link to Inapproximability results for combinatorial auctions with submodular utility functions (Q943868):

Displaying 27 items.

• Truthful mechanism design via correlated tree rounding (Q526848) (← links)
• An accelerated continuous greedy algorithm for maximizing strong submodular functions (Q887854) (← links)
• Inapproximability results for combinatorial auctions with submodular utility functions (Q943868) (← links)
• Near-optimal asymmetric binary matrix partitions (Q1702119) (← links)
• Approximation algorithms for vertex happiness (Q2326078) (← links)
• A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation (Q2436693) (← links)
• Combinatorial auctions with decreasing marginal utilities (Q2506310) (← links)
• Limitations of randomized mechanisms for combinatorial auctions (Q2516249) (← links)
• Combinatorial problems with discounted price functions in multi-agent systems (Q2908875) (← links)
• On maximizing welfare when utility functions are subadditive (Q2931368) (← links)
• Near-Optimal Asymmetric Binary Matrix Partitions (Q2946372) (← links)
• The submodular welfare problem with demand queries (Q3002824) (← links)
• Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions (Q3010396) (← links)
• Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders (Q3169079) (← links)
• Impossibility Results for Truthful Combinatorial Auctions with Submodular Valuations (Q3177762) (← links)
• Approximation Algorithms for k-Duplicates Combinatorial Auctions with Subadditive Bidders (Q3611968) (← links)
• Algorithmic Aspects of Private Bayesian Persuasion. (Q4638086) (← links)
• Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders (Q4997307) (← links)
• When Are Welfare Guarantees Robust (Q5002625) (← links)
• (Q5009516) (← links)
• (Q5090397) (← links)
• (Q5111732) (← links)
• On Maximizing Welfare When Utility Functions Are Subadditive (Q5189541) (← links)
• Computing and Combinatorics (Q5716982) (← links)
• Truthful randomized mechanisms for combinatorial auctions (Q5891528) (← links)
• Mechanism design for perturbation stable combinatorial auctions (Q5918751) (← links)
• Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings (Q6075859) (← links)