Alon Altman
Stanford University
15 Papers
96 Citations
Alon Altman is an academic researcher from Stanford University. The author has contributed to research in topics: Computer science & Game theory. The author has an hindex of 8, co-authored 15 publications. Previous affiliations of Alon Altman include Google.
Chat about Author
Papers
•Proceedings Article
On the complexity of schedule control problems for knockout tournaments
Thuc Vu,Alon Altman,Yoav Shoham +2 more
- 10 May 2009
TL;DR: This paper investigates the computational complexity of tournament schedule control, i.e., designing a tournament that maximizes the winning probability a target player.
Patent
Systems and methods for detecting online attacks
Alon Altman,Alessandro Epasto +1 more
- 05 Jun 2013
TL;DR: In this paper, the authors proposed a method to identify one or more events associated with users on a social graph, by generating at least one directed acyclic graph (DAG), where each node on the DAG represents a node in the social graph where an event of the type occurs and each edge on the edge represents a propagation of the event from a first node of the edge to a second node of an edge.
28
•Proceedings Article
Analysis of a winning computational billiards player
Christopher Archibald,Alon Altman,Yoav Shoham +2 more
- 11 Jul 2009
TL;DR: In this article, the authors discuss CUECARD, the program that won the 2008 Computer Olympiad computational pool tournament, and isolate the factors that contributed to the performance so that the lessons can be transferred to other, similar domains.
Patent
Compromised password mitigation
Alon Altman
- 24 Oct 2011
TL;DR: In this paper, the compromised password mitigation module comprises a compromised password collection module, compromised password storing module, a logging module, account protection module and user database, which is used when evaluating access to determine whether a submitted password matches both a compromised passwords hash and an actual password hash.
17
•Proceedings Article
Nonmanipulable randomized tournament selections
Alon Altman,Robert Klienberg +1 more
- 11 Jul 2010
TL;DR: It is shown that useful choice rules satisfying both notions of non-manipulability, and for the transferable utility case provide bounds on the level of Condorcet consistency.
15