Call Us 080-41656200 (Mon-Sat: 10AM-8PM)
Free Shipping above Rs. 1499
Cash On Delivery*

Bounds for Monotone Algorithms


Marketed By :  VDM Verlag Dr. Müller   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days


Check Your Delivery Options

Rs. 3,651

Availability: In stock

  • Product Description

In the first part "Mechanism Design and Monotone Algorithms", the motivating question is whether the results on truthful mechanisms in Archer and Tardos'' paper "Truthful Mechanisms for One-Parameter Agents" are basically a rediscovery of those Myerson introduces in his paper "Optimal Auction Design". To answer that question, we reveal similarities and differences of both papers and give alternative proofs of the main result to underline the correlation of the approaches. The first part also provides the background for the second part "Bounds for Monotone Scheduling Algorithms". Here, we consider monotone algorithms in the context of scheduling problems. We develop a general model to find lower bounds for a certain scheduling problem. In a related matter, we classify monotone algorithms for the deterministic, randomized and online case and prove lower bounds for these algorithms.

Product Specifications
SKU :COC48007
AuthorJoachim Stadel
Number of Pages96
Publishing Year2010-02-28T00:00:00.000
Edition1 st
Book TypeMathematics
Country of ManufactureIndia
Product BrandVDM Verlag Dr. Müller
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-04-08 00:00:00
0 Review(s)