Publication:3524720
From MaRDI portal
zbMath1152.91453MaRDI QIDQ3524720
Publication date: 12 September 2008
91B26: Auctions, bargaining, bidding and selling, and other market models
Related Items
Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders, Optimally Deceiving a Learning Leader in Stackelberg Games, When Are Welfare Guarantees Robust, Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints, Is Shapley Cost Sharing Optimal?, Unnamed Item, Walrasian equilibria from an optimization perspective: A guide to the literature, Pricing combinatorial auctions by a set of linear price vectors, Optimal shill bidding in the VCG mechanism, Truthful mechanism design via correlated tree rounding, Computing equilibria: a computational complexity perspective, Time bounds for iterative auctions: a unified approach by discrete convex analysis, Buyback problem with discrete concave valuation functions, Exact bounds for steepest descent algorithms of $L$-convex function minimization, 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, Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions, Note on time bounds of two-phase algorithms for \(L\)-convex function minimization, A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation, Limits of Efficiency in Sequential Auctions, Recognizing Coverage Functions, Ad Exchange: Envy-Free Auctions with Mediators
