From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract).

B. Awerbuch, Y. Azar, A. Fiat, и F. Leighton. STOC, стр. 519-530. ACM, (1996)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Competitive distributed file allocation.B. Awerbuch, Y. Bartal, и A. Fiat. STOC, стр. 164-173. ACM, (1993)Competitive Odds and Ends.A. Fiat, и G. Woeginger. Online Algorithms, том 1442 из Lecture Notes in Computer Science, стр. 385-394. Springer, (1996)Decision Trees: More Theoretical Justification for Practical Algorithms.A. Fiat, и D. Pechyony. ALT, том 3244 из Lecture Notes in Computer Science, стр. 156-170. Springer, (2004)History-Independent Distributed Multi-agent Learning.A. Fiat, Y. Mansour, и M. Schain. SAGT, том 9928 из Lecture Notes in Computer Science, стр. 77-89. Springer, (2016)Competitive Non-Preemptive Call Control.B. Awerbuch, Y. Bartal, A. Fiat, и A. Rosén. SODA, стр. 312-320. ACM/SIAM, (1994)An Economic-Based Analysis of RANKING for Online Bipartite MatchingA. Eden, M. Feldman, A. Fiat, и K. Segal. (2018)cite arxiv:1804.06637.Beyond myopic best response (in Cournot competition).A. Fiat, E. Koutsoupias, K. Ligett, Y. Mansour, и S. Olonetsky. SODA, стр. 993-1005. SIAM, (2012)Foreword.A. Fiat, и S. Irani. Theor. Comput. Sci., 324 (2-3): 133-135 (2004)Competitive Algorithms for the Weighted Server Problem.A. Fiat, и M. Ricklin. Theor. Comput. Sci., 130 (1): 85-99 (1994)Rigorous Time/Space Trade-offs for Inverting Functions.A. Fiat, и M. Naor. SIAM J. Comput., 29 (3): 790-803 (1999)