Pages that link to "Item:Q2931368"

The following pages link to On maximizing welfare when utility functions are subadditive (Q2931368):

Displaying 21 items.

• Approximation algorithms for inventory problems with submodular or routing costs (Q344939) (← links)
• Maximizing a class of submodular utility functions (Q543403) (← links)
• Permutation betting markets: singleton betting with extra information (Q547299) (← links)
• Energy efficient monitoring in sensor networks (Q627527) (← links)
• The balloon popping problem revisited: lower and upper bounds (Q647488) (← links)
• On competitiveness in uniform utility allocation markets (Q833560) (← links)
• Scheduling to maximize participation (Q935466) (← links)
• Inapproximability results for combinatorial auctions with submodular utility functions (Q943868) (← links)
• PASS approximation: a framework for analyzing and designing heuristics (Q1950388) (← links)
• Approximating Nash social welfare under binary XOS and binary subadditive valuations (Q2152132) (← links)
• Learning in auctions: regret is hard, envy is easy (Q2155904) (← links)
• Best-response dynamics in combinatorial auctions with item bidding (Q2155910) (← links)
• Economic efficiency requires interaction (Q2278948) (← links)
• Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions (Q2290687) (← links)
• Optimization with demand oracles (Q2414860) (← links)
• (Almost) efficient mechanisms for bilateral trading (Q2667262) (← links)
• Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas (Q2816303) (← links)
• Santa Claus Meets Hypergraph Matchings (Q3541783) (← links)
• Scheduling to Maximize Participation (Q3608460) (← links)
• Truthful randomized mechanisms for combinatorial auctions (Q5891528) (← links)
• Combinatorial reallocation mechanisms (Q6130328) (← links)