scientific article
From MaRDI portal
Publication:3524720
zbMath1152.91453MaRDI QIDQ3524720
Publication date: 12 September 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
Computing equilibria: a computational complexity perspective ⋮ Ad Exchange: Envy-Free Auctions with Mediators ⋮ Pricing combinatorial auctions by a set of linear price vectors ⋮ Note on time bounds of two-phase algorithms for \(L\)-convex function minimization ⋮ Limits of Efficiency in Sequential Auctions ⋮ Recognizing Coverage Functions ⋮ Walrasian equilibria from an optimization perspective: A guide to the literature ⋮ Optimal shill bidding in the VCG mechanism ⋮ A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation ⋮ When Are Welfare Guarantees Robust ⋮ Time bounds for iterative auctions: a unified approach by discrete convex analysis ⋮ Buyback problem with discrete concave valuation functions ⋮ Truthful mechanism design via correlated tree rounding ⋮ Simple combinatorial auctions with budget constraints ⋮ Walrasian's characterization and a universal ascending auction ⋮ Pricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problem ⋮ Welfare maximization with production costs: a primal dual approach ⋮ Exact bounds for steepest descent algorithms of $L$-convex function minimization ⋮ Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions ⋮ Is Shapley Cost Sharing Optimal? ⋮ Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders ⋮ Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints ⋮ Unnamed Item ⋮ Optimally Deceiving a Learning Leader in Stackelberg Games
This page was built for publication:
