scientific article; zbMATH DE number 2086678
From MaRDI portal
Publication:4737215
zbMath1057.68645MaRDI QIDQ4737215
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23800868.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25) Combinatorial aspects of packing and covering (05B40)
Related Items (10)
On the complexity of price equilibria ⋮ Inapproximability of Truthful Mechanisms via Generalizations of the Vapnik--Chervonenkis Dimension ⋮ Truthful randomized mechanisms for combinatorial auctions ⋮ Limitations of VCG-based mechanisms ⋮ The communication requirements of social choice rules and supporting budget sets ⋮ On the efficiency of the proportional allocation mechanism for divisible resources ⋮ Combinatorial auctions without money ⋮ Combinatorial auctions with verification are tractable ⋮ On the Approximability of Combinatorial Exchange Problems ⋮ Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem
This page was built for publication:
