Work

Efficient algorithms for learning to play repeated games against computationally bounded adversaries

Year: 2002

Type: conference-paper

Source: Annual Symposium on Foundations of Computer Science

DOI: 10.1109/sfcs.1995.492489

Authors: Y. Freund, M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R.E. Schapire

Institutions: AT&T (United States), Tel Aviv University, Anna University, Chennai, Massachusetts Institute of Technology, Cornell University

Language: English

Topic: Game Theory and Applications

Subfield: Management Science and Operations Research

Field: Decision Sciences

Domain: Social Sciences

Open Access status: closed

OpenAlex ID: W2167448192

FWCI: 5.209

Cites: 15

Cited by: 37

Related to: 10