N. Bora Keskin

Operational Research · 2014

A researcher in the Science corpus: 1 paper; trusts 4 researchers and is trusted by 5 researchers here, as inferred from the citation graph.

Whom N. Bora Keskin trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Robert D. Kleinberg
  2. Omar Besbes
  3. Assaf J. Zeevi
  4. Frank Thomson Leighton

Who trusts N. Bora Keskin overall

  1. Ming Chen
  2. Hamsa Bastani
  3. Zhi-Long Chen
  4. Mohsen Bayati
  5. Khashayar Khosravi

Papers from N. Bora Keskin's perspective

Ordered by how strongly the researchers N. Bora Keskin trusts endorse each paper. Same corpus, a different order for every researcher.

  1. The value of knowing a demand curve: bounds on regret for online posted-price auctions (44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.)
  2. Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms (Operational Research)
  3. Applications of the van Trees inequality : a Bayesian Cramr-Rao bound
  4. Finite-time Analysis of the Multiarmed Bandit Problem
  5. Some aspects of the sequential design of experiments
  6. Multi-armed Bandit Allocation Indices
  7. Online Convex Programming and Generalized Infinitesimal Gradient Ascent
  8. Online convex optimization in the bandit setting: gradient descent without a gradient
  9. Stochastic Estimation of the Maximum of a Regression Function
  10. Asymptotically efficient adaptive allocation rules

Their papers