2015 - Member of the National Academy of Engineering For contributions to formation evaluation and development of pulsed nuclear magnetic resonance logging.
2008 - Fellow of Alfred P. Sloan Foundation
His main research concerns Online algorithm, Mathematical optimization, Mathematical economics, Combinatorics and Common value auction. Robert Kleinberg has researched Online algorithm in several fields, including Element, Sequence, Secretary problem and Overlay network. Robert Kleinberg interconnects Upper and lower bounds, Regret and Shortest path problem in the investigation of issues within Mathematical optimization.
Many of his research projects under Mathematical economics are closely connected to Special case with Special case, tying the diverse disciplines of science together. His Combinatorics research incorporates themes from Discrete mathematics and Multiplication. The concepts of his Common value auction study are interwoven with issues in Incentive, Demand forecasting and Electronic trading.
Mathematical optimization, Combinatorics, Upper and lower bounds, Mathematical economics and Discrete mathematics are his primary areas of study. Online algorithm is the focus of his Mathematical optimization research. His Combinatorics study combines topics from a wide range of disciplines, such as Function and Bounded function.
His Upper and lower bounds research is multidisciplinary, incorporating perspectives in Undirected graph, Theoretical computer science, Communication complexity and Degree. The various areas that Robert Kleinberg examines in his Mathematical economics study include Fraction and Combinatorial auction. His work in Discrete mathematics tackles topics such as Approximation algorithm which are related to areas like Hamiltonian path.
His primary areas of study are Mathematical optimization, Combinatorics, Process, Mechanism design and Upper and lower bounds. Robert Kleinberg combines Mathematical optimization and Distribution in his studies. His Combinatorics study combines topics in areas such as Discrete mathematics and Secretary problem.
As a part of the same scientific study, Robert Kleinberg usually deals with the Secretary problem, concentrating on Independent set and frequently concerns with Online algorithm and Bounded function. The study incorporates disciplines such as Incentive compatibility, Reduction and Maximization in addition to Mechanism design. The Upper and lower bounds study combines topics in areas such as Theoretical computer science, Prior probability and Degree.
Robert Kleinberg mainly investigates Mathematical optimization, Mechanism design, Combinatorics, Process and Function. In his work, Robert Kleinberg performs multidisciplinary research in Mathematical optimization and Procrastination. His Mechanism design study integrates concerns from other disciplines, such as Common value auction, Matroid and Investment.
His studies in Matroid integrate themes in fields like Competitive analysis, Auction theory, Mathematical economics, Stochastic optimization and Bayesian probability. His research integrates issues of Stochastic process and Secretary problem in his study of Combinatorics. He works mostly in the field of Secretary problem, limiting it down to topics relating to Bounded function and, in certain cases, Online algorithm.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Learning diverse rankings with multi-armed bandits
Filip Radlinski;Robert Kleinberg;Thorsten Joachims.
international conference on machine learning (2008)
Geographic Routing Using Hyperbolic Space
ieee international conference computer and communications (2007)
Nearly Tight Bounds for the Continuum-Armed Bandit Problem
Robert D. Kleinberg.
neural information processing systems (2004)
Multi-armed bandits in metric spaces
Robert Kleinberg;Aleksandrs Slivkins;Eli Upfal.
symposium on the theory of computing (2008)
The value of knowing a demand curve: bounds on regret for online posted-price auctions
R. Kleinberg;T. Leighton.
foundations of computer science (2003)
A multiple-choice secretary algorithm with applications to online auctions
symposium on discrete algorithms (2005)
Matroids, secretary problems, and online mechanisms
Moshe Babaioff;Nicole Immorlica;Robert Kleinberg.
symposium on discrete algorithms (2007)
Algorithmic pricing via virtual valuations
Shuchi Chawla;Jason D. Hartline;Robert Kleinberg.
electronic commerce (2007)
Network performance monitoring in a content delivery system
F. Thomson Leighton;Rizwan S. Dhanidina;Robert D. Kleinberg;Matthew Levine.
The K-armed dueling bandits problem
Yisong Yue;Josef Broder;Robert Kleinberg;Thorsten Joachims.
Journal of Computer and System Sciences (2012)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: