On the complexity of computing algebraic functions

von Mansour, Yishay
Veröffentlicht 1990

GRAPH-BASED DISCRIMINATORS: SAMPLE COMPLEXITY AND EXPRESSIVENESS

von Livni, Roi
Veröffentlicht in NeurIPS (33. : 2019 : Vancouver, British Columbia) 32nd Conference on Neural Information Processing Systems (NeurIPS 2019) ; Volume 9 of 20 (2020)

ONLINE STOCHASTIC SHORTEST PATH WITH BANDIT FEEDBACK AND UNKNOWN TRANSITION FUNCTION

von Rosenberg, Aviv
Veröffentlicht in NeurIPS (33. : 2019 : Vancouver, British Columbia) 32nd Conference on Neural Information Processing Systems (NeurIPS 2019) ; Volume 3 of 20 (2020)

A network creation game with nonuniform interests

von Halevi, Yair
Veröffentlicht in Internet and network economics (2007)

Oracle-Efficient Regret Minimization in Factored MDPs with Unknown Structure

von Rosenberg, Aviv
Veröffentlicht in NeurIPS (35. : 2021 : Online) 35th Conference on Neural Information Processing Systems (NeurIPS 2021) ; Volume 14 of 36 (2022)

How long to equilibrium? : the communication complexity of uncoupled equilibrium procedures

von Hart, Sergiu
Veröffentlicht in Games and economic behavior (2010)

A construction of a cipher from a single psuedorandom permutation

von Even, Shimon
Veröffentlicht 1991

Ad exchange : proposal for a new trading agent competition game

von Schain, Mariano
Veröffentlicht in Agent-mediated electronic commerce (2013)

The communication complexity of uncoupled Nash equilibrium proceudres

von Hart, Sergiu
Veröffentlicht 2006

INDIVIDUAL REGRET IN COOPERATIVE NONSTOCHASTIC MULTI-ARMED BANDITS

von Bar-On, Yogev
Veröffentlicht in NeurIPS (33. : 2019 : Vancouver, British Columbia) 32nd Conference on Neural Information Processing Systems (NeurIPS 2019) ; Volume 4 of 20 (2020)

DUELING CONVEX OPTIMIZATION

von SAHA, AADIRUPA
Veröffentlicht in International Conference on Machine Learning (38. : 2021 : Online) International Conference on Machine Learning (ICML 2021 ; Part 12 of 16 (2022)

Optimal Rates for Random Order Online Optimization

von Sherman, Uri
Veröffentlicht in NeurIPS (35. : 2021 : Online) 35th Conference on Neural Information Processing Systems (NeurIPS 2021) ; Volume 3 of 36 (2022)

ADVERSARIAL DUELING BANDITS

von SAHA, AADIRUPA
Veröffentlicht in International Conference on Machine Learning (38. : 2021 : Online) International Conference on Machine Learning (ICML 2021 ; Part 12 of 16 (2022)

Strong price of anarchy

von Andelman, Nir
Veröffentlicht in Games and economic behavior (2009)

Sample Complexity of Uniform Convergence for Multicalibration

von Shabat, Eliran
Veröffentlicht in NeurIPS (34. : 2020 : Online) 34th Conference on Neural Information Processing Systems (NeurIPS 2020) ; Volume 16 of 27 (2021)

Bayesian incentive-compatible bandit exploration

von Mansour, Yishay
Veröffentlicht in Operations research (2020)

A Characterization of Semi-Supervised Adversarially Robust PAC Learnability

von Attias, Idan
Veröffentlicht in NeurIPS (36. : 2022 : New Orleans, La.; Online) 36th Conference on Neural Information Processing Systems (NeurIPS 2022 ; Volume 31 of 50 (2023)

Polynomial end-to-end communication

von Awerbuch, Baruch
Veröffentlicht 1989

Efficient graph topologies in network routing games

von Epstein, Amir
Veröffentlicht in Games and economic behavior (2009)

A model-free approach for a TAC-AA trading agent

von Schain, Mariano
Veröffentlicht in Agent-mediated electronic commerce (2013)