scientific article; zbMATH DE number 2079341

zbMath1094.68528MaRDI QIDQ4471296

Éva Tardos, Kunal Talwar, Aaron Archer, Christos H. Papadimitriou

Publication date: 28 July 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

randomized rounding

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (25)

A general impossibility theorem and its application to individual rights ⋮ Single-Parameter Combinatorial Auctions with Partially Public Valuations ⋮ Approximations and auctions for scheduling batches on related machines ⋮ Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design ⋮ Comparing multiagent systems research in combinatorial auctions and voting ⋮ Truthful learning mechanisms for multi-slot sponsored search auctions with externalities ⋮ Spectrum Bidding in Wireless Networks and Related ⋮ Unnamed Item ⋮ Truthful randomized mechanisms for combinatorial auctions ⋮ Bounding the payment of approximate truthful mechanisms ⋮ A monotone approximation algorithm for scheduling with precedence constraints ⋮ Walrasian equilibrium: Hardness, approximations and tractable instances ⋮ Inapproximability results for combinatorial auctions with submodular utility functions ⋮ Deterministic monotone algorithms for scheduling on related machines ⋮ Pricing lotteries ⋮ On complexity of single-minded auction ⋮ Adaptive Incentive-Compatible Sponsored Search Auction ⋮ Combinatorial auctions with verification are tractable ⋮ Preemptive Scheduling on Selfish Machines ⋮ Maximizing the Minimum Load for Selfish Agents ⋮ Unnamed Item ⋮ Truthful mechanisms for two-range-values variant of unrelated scheduling ⋮ A lower bound for scheduling mechanisms ⋮ Mechanism design for set cover games with selfish element agents ⋮ Unnamed Item

This page was built for publication: