Pages that link to "Item:Q5189541"

The following pages link to On Maximizing Welfare When Utility Functions Are Subadditive (Q5189541):

Displaying 49 items.

• Item bidding for combinatorial public projects (Q526903) (← links)
• Uniform price auctions: equilibria and efficiency (Q904682) (← links)
• Gross substitutability: an algorithmic survey (Q1682734) (← links)
• Welfare maximization with friends-of-friends network externalities (Q1693985) (← links)
• Population monotonicity in fair division of multiple indivisible goods (Q2041070) (← links)
• Fractionally subadditive maximization under an incremental knapsack constraint (Q2085751) (← links)
• Tight approximation bounds for maximum multi-coverage (Q2118140) (← links)
• Quality of local equilibria in discrete exchange economies (Q2178594) (← links)
• Pricing multi-unit markets (Q2190388) (← links)
• Combinatorial assortment optimization (Q2190396) (← links)
• Simultaneous auctions without complements are (almost) efficient (Q2206818) (← links)
• Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents (Q2237895) (← links)
• Computing a small agreeable set of indivisible items (Q2321268) (← links)
• Approximation algorithms for vertex happiness (Q2326078) (← links)
• The implicit welfare weights used when maximizing aggregate surplus (Q2368062) (← links)
• A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation (Q2436693) (← links)
• Limitations of VCG-based mechanisms (Q2454572) (← links)
• Limitations of randomized mechanisms for combinatorial auctions (Q2516249) (← links)
• Fair allocation of indivisible goods: beyond additive valuations (Q2667816) (← links)
• Item Pricing for Combinatorial Public Projects (Q2830053) (← links)
• On maximizing welfare when utility functions are subadditive (Q2931368) (← links)
• Welfare maximization and the supermodular degree (Q2986874) (← links)
• The submodular welfare problem with demand queries (Q3002824) (← links)
• Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) (Q3088096) (← links)
• Computing Stable Coalitions: Approximation Algorithms for Reward Sharing (Q3460775) (← links)
• Oblivious Rounding and the Integrality Gap (Q4636438) (← links)
• Testing submodularity and other properties of valuation functions (Q4638085) (← links)
• Worst-Case Mechanism Design via Bayesian Analysis (Q4978196) (← links)
• Algorithms as Mechanisms: The Price of Anarchy of Relax and Round (Q4991678) (← links)
• A Simple and Approximately Optimal Mechanism for a Buyer with Complements (Q4994150) (← links)
• When Are Welfare Guarantees Robust (Q5002625) (← links)
• Tight Approximation for Unconstrained XOS Maximization (Q5026453) (← links)
• Tight Approximation Bounds for Maximum Multi-coverage (Q5041735) (← links)
• Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions (Q5071085) (← links)
• (Q5091060) (← links)
• (Q5111735) (← links)
• Approximate Modularity Revisited (Q5211809) (← links)
• Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints (Q5245021) (← links)
• (Q5743455) (← links)
• An $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions (Q5864664) (← links)
• (Q5874477) (← links)
• (Q5874555) (← links)
• Risk-free bidding in complement-free combinatorial auctions (Q5918704) (← links)
• Mechanism design for perturbation stable combinatorial auctions (Q5918751) (← links)
• Packing returning secretaries (Q6087124) (← links)
• (Q6087218) (← links)
• Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem (Q6152666) (← links)
• Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows (Q6202753) (← links)
• Prophet secretary for combinatorial auctions and matroids (Q6640585) (← links)