The following pages link to Vahab S. Mirrokni (Q547288):
Displayed 41 items.
- Expanders via Local Edge Flips (Q4575596) (← links)
- (Q4598285) (← links)
- (Q4607920) (← links)
- (Q4633864) (← links)
- A Theoretical Examination of Practical Game Playing: Lookahead Search (Q4910951) (← links)
- Limitations of cross-monotonic cost-sharing schemes (Q4962717) (← links)
- Non‐Clairvoyant Dynamic Mechanism Design (Q4992157) (← links)
- Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions (Q4994157) (← links)
- Brief Announcement: MapReduce Algorithms for Massive Trees (Q5002852) (← links)
- Budget-Management Strategies in Repeated Auctions (Q5003721) (← links)
- Fair Resource Allocation in a Volatile Marketplace (Q5031013) (← links)
- Deals or No Deals: Contract Design for Online Advertising (Q5031634) (← links)
- Dynamic Double Auctions: Toward First Best (Q5106370) (← links)
- Fully Dynamic Matching: Beating 2-Approximation in Δ<sup><i>ϵ</i></sup> Update Time (Q5146943) (← links)
- Coordination Mechanisms for Selfish Routing over Time on a Tree (Q5167741) (← links)
- Non-monotone submodular maximization under matroid and knapsack constraints (Q5172726) (← links)
- Stochastic bandits robust to adversarial corruptions (Q5230281) (← links)
- Dynamic Double Auctions: Towards First Best (Q5236192) (← links)
- Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity (Q5236198) (← links)
- Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs (Q5236282) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313021) (← links)
- Locality-sensitive hashing scheme based on p-stable distributions (Q5361678) (← links)
- Robust Price of Anarchy Bounds via LP and Fenchel Duality (Q5363045) (← links)
- Inner product spaces for MinSum coordination mechanisms (Q5419124) (← links)
- Secure Overlay Network Design (Q5434413) (← links)
- Convergence and Approximation in Potential Games (Q5449812) (← links)
- Local Computation of PageRank Contributions (Q5458308) (← links)
- Approximating Minimum-Power Degree and Connectivity Problems (Q5458548) (← links)
- (Q5501328) (← links)
- On spectrum sharing games (Q5501489) (← links)
- STACS 2005 (Q5710715) (← links)
- Clinching Auctions with Online Supply (Q5741752) (← links)
- Improved approximations for Euclidean <i>k</i> -means and <i>k</i> -median, via nested quasi-independent sets (Q6083617) (← links)
- The landscape of the proximal point method for nonconvex-nonconcave minimax optimization (Q6110439) (← links)
- Contextual Bandits with Cross-Learning (Q6121640) (← links)
- (Q6147335) (← links)
- The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems (Q6202662) (← links)
- Accelerating Greedy Coordinate Descent Methods (Q6302675) (← links)
- Dual Mirror Descent for Online Allocation Problems (Q6335476) (← links)
- Design and Analysis of Bipartite Experiments under a Linear Exposure-Response Model (Q6362619) (← links)
- Approximately Optimal Core Shapes for Tensor Decompositions (Q6425793) (← links)