Interactive Social Systems Under Bounded Rationality
{'Code': '05020000', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'IIS', 'LongName': 'Div Of Information & Intelligent Systems'}}
{'SignBlockName': 'Su-Shing Chen', 'PO_EMAI': None, 'PO_PHON': None}
The last few years have seen increasing mutual awareness and               interaction between computer science and interactive decision                   theory (e.g., game theory, economics).  This has been spurred by                parallel developments in the two disciplines: in computer science,              the advent of distributed systems; in interactive decision theory,              the analysis of increasingly complex social systems, leading to                 the realization that traditional rationality assumptions make                   extremely large demands on the information processing capabilities              of the agents.  Computer scientists started using game-theoretic                and similar interactive models for the study of distributed                     computing systems and economists turned to computer science                     (finite automata, Turing machines, and actual computer programs)                to model bounded rationality. This project concentrates on three                central problems which arise in this connection: (1) Optimization               with limited memory-the study of the effect of limited capacity on              the optimization of rational agents.  The explicit modelling of                 the cost of information processing. (2) Common knowledge-to                     introduce the idea of "formal common knowledge" which would,                    practically speaking, achieve all the desirable coordination                    consequences that would be achieved under common knowledge. (3)                 Social interaction with bounded rationality-to formulate the                    presence of irrationality in social systems and define their                    equilibria. That is, the project initiates a serious study of the               behavior of interactive systems when some or all of the agents are              bounded rational.//
{'FirstName': 'Mordecai', 'LastName': 'Kurz', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Mordecai Kurz', 'EmailAddress': '4157232220', 'NSF_ID': '000116823', 'StartDate': '01/15/1989', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'Stanford University', 'CityName': 'STANFORD', 'ZipCode': '943052004', 'PhoneNumber': '6507232300', 'StreetAddress': '450 JANE STANFORD WAY', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'California', 'StateCode': 'CA', 'CONGRESSDISTRICT': '16', 'CONGRESS_DISTRICT_ORG': 'CA16', 'ORG_UEI_NUM': 'HJD6G4D6TJY5', 'ORG_LGL_BUS_NAME': 'THE LELAND STANFORD JUNIOR UNIVERSITY', 'ORG_PRNT_UEI_NUM': None}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
{'Code': '6850', 'Text': 'DIGITAL SOCIETY&TECHNOLOGIES'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1988&All=true', 'xml': '8814953.xml'}