Zoekresultaten - Rubinstein, Aviad

Beyond matroids: Secretary Problem and Prophet Inequality with general constraints door Rubinstein, Aviad

Volledige tekst
Volledige tekst

Constant-factor approximation of near-linear edit distance in near-linear time door Brakensiek, Joshua, Rubinstein, Aviad

Volledige tekst
Volledige tekst

Communication complexity of Nash equilibrium in potential games door Babichenko, Yakov, Rubinstein, Aviad

Volledige tekst
Volledige tekst

Settling the complexity of Nash equilibrium in congestion games door Babichenko, Yakov, Rubinstein, Aviad

Volledige tekst
Volledige tekst

Budget-Smoothed Analysis for Submodular Maximization door Rubinstein, Aviad, Zhao, Junyao

Volledige tekst
Volledige tekst

The Randomized Communication Complexity of Randomized Auctions door Rubinstein, Aviad, Zhao, Junyao

Volledige tekst
Volledige tekst

Maximizing Non-Monotone Submodular Functions over Small Subsets: Beyond $1/2$-Approximation door Rubinstein, Aviad, Zhao, Junyao

Volledige tekst
Volledige tekst

Fully-dynamic-to-incremental reductions with known deletion order (e.g. sliding window) door Peng, Binghui, Rubinstein, Aviad

Volledige tekst
Volledige tekst

Beyond Worst-Case Budget-Feasible Mechanism Design door Rubinstein, Aviad, Zhao, Junyao

Volledige tekst
Volledige tekst

Near Optimal Memory-Regret Tradeoff for Online Learning door Peng, Binghui, Rubinstein, Aviad

Volledige tekst
Volledige tekst

Approximate Earth Mover's Distance in Truly-Subquadratic Time door Beretta, Lorenzo, Rubinstein, Aviad

Volledige tekst
Volledige tekst

Fast swap regret minimization and applications to approximate correlated equilibria door Peng, Binghui, Rubinstein, Aviad

Volledige tekst
Volledige tekst

Envy-Free Cake-Cutting for Four Agents door Hollender, Alexandros, Rubinstein, Aviad

Volledige tekst
Volledige tekst

Quantum Communication Complexity of Classical Auctions door Rubinstein, Aviad, Zhou, Zixin

Volledige tekst
Volledige tekst

Strategizing against No-Regret Learners in First-Price Auctions door Rubinstein, Aviad, Zhao, Junyao

Volledige tekst
Volledige tekst

The complexity of approximate (coarse) correlated equilibrium for incomplete information games door Peng, Binghui, Rubinstein, Aviad

Volledige tekst
Volledige tekst

Approximation Schemes for Edit Distance and LCS in Quasi-Strongly Subquadratic Time door Mao, Xiao, Rubinstein, Aviad

Volledige tekst
Volledige tekst

Secretary, Prophet, and Stochastic Probing via Big-Decisions-First door Rubinstein, Aviad, Singla, Sahil

Volledige tekst
Volledige tekst

Improved Combinatorial Auctions with and without Samples door Rubinstein, Aviad, Singla, Sahil

Volledige tekst
Volledige tekst

Can Almost Everybody be Almost Happy? PCP for PPAD and the Inapproximability of Nash door Babichenko, Yakov, Papadimitriou, Christos, Rubinstein, Aviad

Volledige tekst
Volledige tekst