Moshe Babaioff

Encyclopedia of Algorithms · 2007–2008

A researcher in the Science corpus: 2 papers; trusts 1 researcher and is trusted by 6 researchers here, as inferred from the citation graph.

Whom Moshe Babaioff trusts overall

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

  1. Robert D. Kleinberg

Who trusts Moshe Babaioff overall

  1. Susanne Albers
  2. Niv Buchbinder
  3. Shipra Agrawal
  4. Leon Ladewig
  5. Ariel D. Procaccia
  6. Sharrukh Zaman
  7. Andjela Mladenovic
  8. Arindam Khan
  9. Kamal Kumar Jain
  10. Zizhuo Wang

Papers from Moshe Babaioff's perspective

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

  1. Approximating the stochastic knapsack problem: the benefit of adaptivity (45th Annual IEEE Symposium on Foundations of Computer Science)
  2. A multiple-choice secretary algorithm with applications to online auctions
  3. Proof verification and hardness of approximation problems
  4. Faster and simpler algorithms for multicommodity flow and other fractional packing problems
  5. Fast approximation algorithms for fractional packing and covering problems
  6. Asymptotically Efficient Adaptive Allocation Rules
  7. Train faster, generalize better: Stability of stochastic gradient descent
  8. An analysis of approximations for maximizing submodular set functions—I
  9. Multi-parameter mechanism design and sequential posted pricing (Behavioral and Quantitative Game Theory)
  10. Asymptotically efficient adaptive allocation rules

Their papers