Titlebook: Computing and Combinatorics; 19th International C Ding-Zhu Du,Guochuan Zhang Conference proceedings 2013 Springer-Verlag Berlin Heidelberg

GRAVE

Conference proceedings 2013na, in June 2013. The 56 revised full papers presented were carefully reviewed and selected from 120 submissions. There was a co-organized workshop on discrete algorithms of which 8 short papers were accepted and a workshop on computational social networks where 12 papers out of 25 submissions were accepted.

Confound

Ding-Zhu Du,Guochuan ZhangUp-to-date results.Fast track conference proceedings.State-of-the-art report

Immobilize

Deceit

GOUGE

978-3-642-38767-8Springer-Verlag Berlin Heidelberg 2013

MENT

amphibian

https://doi.org/10.1007/BFb0008699e famous secretary problem asks to identify a stopping rule that maximizes the probability of selecting the maximum element in a sequence presented in uniformly random order. In a similar vein, the prophet inequality of Krengel, Sucheston, and Garling establishes the existence of an online algorithm

accessory

https://doi.org/10.1007/BFb0008699with anonymous bidders with respect to the best fixed-price scheme. Previous works show that the optimal solution for this problem is in the range [1.6595,2]. We give a new lower bound of 1.68 and design an .(..) algorithm for computing upper bounds as a function of the number of bidders .. Our algo

Commission

syncope