The following pages link to Robert D. Kleinberg (Q1809558):
Displayed 50 items.
- Item:Q1809558 (redirect page) (← links)
- The \(K\)-armed dueling bandits problem (Q440003) (← links)
- Load balancing without regret in the bulletin board model (Q661046) (← links)
- Congestion games with malicious players (Q834852) (← links)
- Fast matrix multiplication is stable (Q879926) (← links)
- Competitive collaborative learning (Q959897) (← links)
- Matroid prophet inequalities and applications to multi-dimensional mechanism design (Q1735736) (← links)
- Stability and auctions in labor markets with job security (Q1783457) (← links)
- Train tracks and zipping sequences for pseudo-Anosov braids (Q1809559) (← links)
- Regret bounds for sleeping experts and bandits (Q1959599) (← links)
- Truthful germs are contagious: a local-to-global characterization of truthfulness (Q2016243) (← links)
- Full surplus extraction from samples (Q2025025) (← links)
- A diameter-revealing proof of the Bondy-Lovász lemma (Q2059880) (← links)
- Threshold tests as quality signals: optimal strategies, equilibria, and Price of anarchy (Q2152123) (← links)
- Introduction to computer science and economic theory (Q2253830) (← links)
- Pricing lotteries (Q2253836) (← links)
- Prior independent mechanisms via prophet inequalities with limited information (Q2278945) (← links)
- Orienteering for electioneering (Q2417102) (← links)
- Online linear optimization and adaptive routing (Q2462507) (← links)
- Approximately optimal auctions for correlated bidders (Q2516248) (← links)
- Bayesian incentive compatibility via matchings (Q2516250) (← links)
- Optimal stopping with behaviorally biased agents: the role of loss aversion and changing reference points (Q2673227) (← links)
- Revenue monotonicity under misspecified bidders (Q2692279) (← links)
- Truthful Mechanisms with Implicit Payment Computation (Q2796397) (← links)
- Approximating low-dimensional coverage problems (Q2874577) (← links)
- (Q2921671) (← links)
- (Q2921680) (← links)
- (Q2921721) (← links)
- (Q2921741) (← links)
- (Q2934624) (← links)
- (Q2934677) (← links)
- (Q2934683) (← links)
- Simple and Near-Optimal Mechanisms for Market Intermediation (Q2937000) (← links)
- Secretary Problems with Non-Uniform Arrival Order (Q2941585) (← links)
- (Q2969654) (← links)
- (Q3132879) (← links)
- Improving Christofides' Algorithm for the s-t Path TSP (Q3177743) (← links)
- Polymatroid Prophet Inequalities (Q3452806) (← links)
- Localized Client-Server Load Balancing without Global Information (Q3519396) (← links)
- (Almost) Tight bounds and existence theorems for single-commodity confluent flows (Q3546347) (← links)
- Adaptive routing with end-to-end feedback (Q3580958) (← links)
- (Almost) tight bounds and existence theorems for confluent flows (Q3581008) (← links)
- Consistent load balancing via spread minimization (Q3581256) (← links)
- Anytime algorithms for multi-armed bandit problems (Q3581512) (← links)
- Improved lower and upper bounds for universal TSP in planar metrics (Q3581548) (← links)
- New lower bounds for oblivious routing in undirected graphs (Q3581557) (← links)
- The Serializability of Network Codes (Q3587431) (← links)
- Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem (Q3588395) (← links)
- Improved Lower Bounds for the Universal and a priori TSP (Q3588406) (← links)
- A Knapsack Secretary Problem with Applications (Q3603454) (← links)