Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/94304
Authors: 
Friedman, Eric
Year of Publication: 
1998
Series/Report no.: 
Working Papers, Department of Economics, Rutgers, The State University of New Jersey 1998-24
Abstract: 
In this paper we study a large class of non-atomic games arising from interactions on the Internet, such as many users sharing a network link, researchers accessing a database or web server, subscribers to a network services provider trying to gain access to the modem pool and many more. We provide simple and easily computable conditions under which these games are learnable by several models of learning, such as adaptive and sophisticated learning (Milgrom and Roberts 1991), calibrated learning (Foster and Vohra 1996), and reasonable learning (Friedman and Shenker 1997). Thus, using these methods one can evaluate the stability of such games on the Internet or in other settings in which players must learn over time.
Subjects: 
learning
JEL: 
C72
Document Type: 
Working Paper

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.