The following pages link to Yishay Mansour (Q222241):
Displaying 50 items.
- Circumventing the price of anarchy: leading dynamics to good behavior (Q2839178) (← links)
- Converting Online Algorithms to Local Computation Algorithms (Q2843290) (← links)
- Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions (Q2843297) (← links)
- Scheduling Subset Tests: One-Time, Continuous, and How They Relate (Q2851850) (← links)
- A Local Computation Approximation Scheme to Maximum Matching (Q2851862) (← links)
- The load-distance balancing problem (Q2892142) (← links)
- Competitive Router Scheduling with Structured Data (Q2896392) (← links)
- Fast convergence of selfish rerouting (Q2921740) (← links)
- Online trading algorithms and robust option pricing (Q2931410) (← links)
- (Q2934596) (← links)
- (Q2934597) (← links)
- Randomness in private computations (Q2942730) (← links)
- Adapting to a reliable network path (Q2943777) (← links)
- Robust Inference and Local Algorithms (Q2946324) (← links)
- Regret Minimization for Reserve Prices in Second-Price Auctions (Q2978838) (← links)
- Combining online algorithms for acceptance and rejection (Q3002759) (← links)
- Competitive queue policies for differentiated services (Q3022750) (← links)
- (Q3046711) (← links)
- (Q3093180) (← links)
- (Q3093298) (← links)
- (Q3093383) (← links)
- Regret Minimization Algorithms for Pricing Lookback Options (Q3093953) (← links)
- Repeated Budgeted Second Price Ad Auction (Q3095252) (← links)
- Pricing Exotic Derivatives Using Regret Minimization (Q3095279) (← links)
- Slide—The Key to Polynomial End-to-End Communication (Q3125223) (← links)
- Efficient On-Line Call Control Algorithms (Q3128992) (← links)
- IMPROVED SELECTION IN TOTALLY MONOTONE ARRAYS (Q3136720) (← links)
- Constant depth circuits, Fourier transform, and learnability (Q3140018) (← links)
- Online Set Packing (Q3143291) (← links)
- (Q3148823) (← links)
- (Q3148830) (← links)
- Lower Bounds on Individual Sequence Regret (Q3164826) (← links)
- Online Markov Decision Processes (Q3169063) (← links)
- (Q3174120) (← links)
- Upward Max-Min Fairness (Q3177883) (← links)
- Lower Bounds for Computations with the Floor Operation (Q3212292) (← links)
- Bayesian Incentive-Compatible Bandit Exploration (Q3387959) (← links)
- Scheduling Multipacket Frames with Frame Deadlines (Q3460708) (← links)
- Online Allocation and Pricing with Economies of Scale (Q3460785) (← links)
- (Q3524713) (← links)
- Agnostically Learning Halfspaces (Q3549323) (← links)
- (Q3549631) (← links)
- (Q3579445) (← links)
- Convergence time to Nash equilibrium in load balancing (Q3580944) (← links)
- Learning with attribute costs (Q3581435) (← links)
- On nash equilibria for a network creation game (Q3581526) (← links)
- Finding the edge connectivity of directed graphs (Q3815335) (← links)
- (Q4013546) (← links)
- Lower Bounds for Randomized Mutual Exclusion (Q4210122) (← links)
- Optimal Broadcast with Partial Knowledge (Q4210163) (← links)
