Mansour, Yishay - School of Computer Science, Tel Aviv University

• Optimizing TCP Retransmission Timeout Alex Kesselman1,
• Tight Bounds for WorstCase Equilibria Artur Czumaj
• Efficient OnLine Call Control Algorithms \Lambda Juan A. Garay y Inder S. Gopal y Shay Kutten y
• Learning rates for Q-Learning Eyal Even-Dar and Yishay Mansour
• Boosting with MultiWay Branching in Decision Trees
• Selfish Traffic Allocation for Server Farms # Artur Czumaj
• Phantom: A Simple and Effective Flow Control Scheme \Lambda Yehuda Afek Yishay Mansour Zvi Ostfeld
• Playing Large Games Using Simple Strategies Richard J. Lipton Evangelos Markakis y Aranyak Mehta y
• ''discrepancy sets and their applications for interpolation of sparse polynomials
• On Nash Equilibria for a Network Creation Game Susanne Albers
• Journal of Algorithms 46 (2003) 7995 www.elsevier.com/locate/jalgor
• Competitive On-Line Paging Strategies for Mobile Users Under Delay Constraints
• Reinforcement Learning in POMDPs Without Resets Eyal Even-Dar
• (In)Stability Properties of Limit Order Dynamics Eyal Even-Dar
• Strong Price of Anarchy Nir Andelman
• Strong Equilibrium in Cost Sharing Connection Games Amir Epstein
• A Time-Optimal Self-Stabilizing Synchronizer Using a Phase Clock
• Tel Aviv University The Raymond and Beverly Sackler
• Arguably, the birth of the Internet, the first multi-network communications experiment, took place in November of 1977. This experiment connected the Advanced Research
• Final ReportWorkshop in Reinforcement Learning Mancalaame ofGpplication of Reinforcement Learning to theA
• Fast Convergence of Selfish Rerouting Eyal Even-Dar
• A tight bound for approximating the square root Nader H. Bshouty \Lambda Yishay Mansour y Baruch Schieber z Prasoon Tiwari z
• On Lotteries with Unique Winners \Lambda Eyal Kushilevitz y Yishay Mansour z Michael O. Rabin x
• Agnostic Boosting Shai Ben-David 1 , Philip M. Long 2 , and Yishay Mansour 3
• Competitive Queue Policies for Differentiated Services
• Concentration Bounds for Unigrams Language Evgeny Drukh and Yishay Mansour
• COMPUTING EQUILIBRIA FOR TWOPERSON GAMES To appear in: Handbook of Game Theory , Vol. 3, eds. R. J. Aumann and S. Hart, North
• Active Sampling for Multiple Output Identification
• GAMES AND ECONOMIC BEHAVIOR 14, 124143 (1996) ARTICLE NO. 0044
• A Fast, BottomUp Decision Tree Pruning Algorithm with
• Combining Multiple Heuristics # Tzur Sayag 1 , Shai Fine 2 , and Yishay Mansour 3
• COMPUTATION IN NOISY RADIO NETWORKS \Lambda EYAL KUSHILEVITZ y AND YISHAY MANSOUR z
• Reinforcement Learning and Mistake Bounded Algorithms Yishay Mansour \Lambda
• Convergence of Optimistic and Incremental QLearning
• Planning in POMDPs Using Multiplicity Automata Eyal Even-Dar
• Auctions with Budget Constraints Nir Andelman and Yishay Mansour
• Regret to the Best vs. Regret to the Average Eyal Even-Dar1
• Generalization Bounds for Decision Trees Yishay Mansour
• Almost kwise independence versus kwise independence Noga Alon \Lambda
• Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded Adversaries
• COMPUTATION OF EQUILIBRIA IN FINITE GAMES \Lambda
• Competitive Dynamic Bandwidth Allocation Amotz BarNoy \Lambda Yishay Mansour y Baruch Schieber z
• Estimating a mixture of two product distributions Yoav Freund \Lambda Yishay Mansour y
• Computation in Noisy Radio Networks Eyal Kushilevitz \Lambda Yishay Mansour y
• Competitive Queueing Policies for QoS Switches Nir Andelman # Yishay Mansour + An Zhu #
• Appearing in the Proceedings of the 26th Annual ACM Symposium on Theory of Computing, May, 1994. On the Learnability of Discrete Distributions
• Efficient Computation of Equilibria for Extensive TwoPerson Games
• Beej's Guide to Network Programming Using Internet Sockets
• Online Learning versus Offline Learning Shai BenDavid 1 and Eyal Kushilevitz 2 and Yishay Mansour 3
• Journal of Algorithms 46 (2003) 120 www.elsevier.com/locate/jalgor
• On Construction of kwise Independent Random Variables Howard Karloff \Lambda Yishay Mansour y
• QoS-Competitive Video Bu ering Alexander Kesselman
• Competitive Access Time via Dynamic Storage Rearrangement
• AN (D log(N/D)) LOWER BOUND FOR BROADCAST IN RADIO NETWORKS
• The Communication Complexity of Uncoupled Nash Equilibrium Procedures
• On the Boosting Ability of TopDown Decision Tree Learning Algorithms
• Pessimistic decision tree pruning based on tree size
• Convergence Time to Nash Equilibria Eyal Even-Dar, Alex Kesselman, and Yishay Mansour
• Boosting Using Branching Programs Yishay Mansour
• Optimal Smoothing Schedules for Real-Time Streams EXTENDED ABSTRACT
• Competitive Algorithms for VWAP and Limit Order Trading
• Why Averaging Classifiers Can Protect Against Overfitting Yoav Freund
• On Construction of kwise Independent Random Variables Howard Karloff \Lambda Yishay Mansour y
• An Approximation Algorithm for MinimumCost Network Design Yishay Mansour \Lambda David Peleg y
• Improved Second-Order Bounds for Prediction with Expert Advice
• Jitter Control in QoS Networks \Lambda Yishay Mansour
• LossBounded Analysis for Differentiated Services. Alexander Kesselman \Lambda Yishay Mansour y
• Competitive Buffer Management for SharedMemory Switches
• Improved Combination of Online Algorithms for Acceptance and Rejection
• Dynamic Bandwidth Allocation Policies \Lambda Y. Afek y , M. Cohen z , E. Haalman x , Y. Mansour --
• Broadcast in Radio Networks Iris Gaber \Lambda Yishay Mansour y
• Experts in a Markov Decision Process Eyal EvenDar
• Buffer Overflow Management in QoS Switches Alexander Kesselman \Lambdax
• Adaptive AIMD Congestion Control Alex Kesselman y
• Agnostically Learning Halfspaces Adam Tauman Kalai
• Randomness in Private Computations Eyal Kushilevitz \Lambda Yishay Mansour y
• From External to Internal Regret Avrim Blum 1 ? and Yishay Mansour 2 ??
• How Bad is Selfish Routing? Tim Roughgarden #
• Learning with Attribute Costs Haim Kaplan
• ManytoOne Packet Routing on Grids EXTENDED ABSTRACT
• Learning with MaximumEntropy Distributions \Lambda Yishay Mansour Mariano Schain
• Learning Boolean Functions via the Fourier Yishay Mansour \Lambda
• Computational Information
• A Sparse Sampling Algorithm for NearOptimal Planning in Large Markov Decision Processes
• On Learning Conjunctions with Malicious Noise \Lambda Yishay Mansour Michal Parnas
• On the Complexity of Policy Iteration Yishay Mansour \Lambda and Satinder Singh
• Online Trading Algorithms and Robust Option Pricing Peter DeMarzo
• Exact Inference of Hidden Structure from Sample Data in NoisyOR Networks
• Implementation issues in the Fourier Transform algorithm \Lambda
• Tradeoffs Between Communication Throughput and Parallel Time Yishay Mansour \Lambda Noam Nisan y Uzi Vishkin z
• An Experimental and Theoretical Comparison of Model Selection Methods
• To appear in Advances in Neural Information Processing Systems 12, MIT Press, 2000 Policy Gradient Methods for
• Bandwidth Allocation with Preemption Amotz BarNoy \Lambda Ran Canetti y Shay Kutten \Lambda Yishay Mansour z Baruch Schieber \Lambda
• A Sufficient Condition for Truthfulness with Single Parameter Agents
• Tel Aviv University The Raymond and Beverly Sackler
• Tel Aviv University Raymond and Beverly Sackler Faculty of Exact Sciences
• Tel-Aviv University The School of Computer Science
• TEL-AVIV UNIVERSITY RAYMOND AND BEVERLY SACKLER
• The Raymond and Beverly Sackler Faculty of Exact Scinces