{"id":{"repo_id":"cornell","oai_identifier":"oai:ecommons.cornell.edu:1813/40965"},"canonical_url":"https://search.ndltd.org/etd/cornell/oai:ecommons.cornell.edu:1813/40965","repository":{"repo_id":"cornell","name":"Cornell University","base_url":"https://ecommons.cornell.edu/server/oai/request"},"display":{"title":"I'M Only Human: Game Theory With Computationally Bounded Agents","abstract":"Rationality in games and decisions is traditionally understood as requiring that agents act optimally. However, as pointed out by Simon [64] acting optimally might be hard. We study how the analysis of games and behaviors changes when agents are assumed to be rational but computationally bounded, and thus cannot always act optimally. We first argue that some observed \"irrational\" human behaviors can be explained by viewing people as computationally bounded agents. We show that adding computation costs into interactive settings have some unintuitive consequences that might lead to behaviors that seem irrational at first. We then consider a dynamic decision problem, and show that some observed human behavior can be actually explained by modeling people as computationally bounded agents that are doing as well as they can, given their limitations. We then develop appropriate models of computationally bounded agents modeled as polynomial-time TM. We study the implications of these models and use these models to analyze different aspect of economic systems. We first develop a model appropriate for a repeated game setting and show that problems that are considered intractable, such as computing a NE in repeated games, actually become tractable in this model. We then develop a model of computational games, which are finite extensive-form games played by computationally bounded players and show an application of this model to the analyzing of cryptographic protocols from a game theoretic perspective.","abstract_html":"Rationality in games and decisions is traditionally understood as requiring that agents act optimally. However, as pointed out by Simon [64] acting optimally might be hard. We study how the analysis of games and behaviors changes when agents are assumed to be rational but computationally bounded, and thus cannot always act optimally. We first argue that some observed &quot;irrational&quot; human behaviors can be explained by viewing people as computationally bounded agents. We show that adding computation costs into interactive settings have some unintuitive consequences that might lead to behaviors that seem irrational at first. We then consider a dynamic decision problem, and show that some observed human behavior can be actually explained by modeling people as computationally bounded agents that are doing as well as they can, given their limitations. We then develop appropriate models of computationally bounded agents modeled as polynomial-time TM. We study the implications of these models and use these models to analyze different aspect of economic systems. We first develop a model appropriate for a repeated game setting and show that problems that are considered intractable, such as computing a NE in repeated games, actually become tractable in this model. We then develop a model of computational games, which are finite extensive-form games played by computationally bounded players and show an application of this model to the analyzing of cryptographic protocols from a game theoretic perspective.","abstract_has_math":false,"creators":["Seeman, Lior"],"institution":"Cornell University","degree_name":"Ph. D., Computer Science","degree_level":"Doctor of Philosophy","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":["Halpern,Joseph Yehuda"],"committee_members":["Blume,Lawrence Edward"],"year":2015,"date_issued":"2015-08-17","date_published":"2015-08-17","updated_at":"2026-11-19T03:18:46Z","subjects":[],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["9255237"],"render_values":[{"text":"9255237","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1813/40965","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/1813/40965","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://ecommons.cornell.edu/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aecommons.cornell.edu%3A1813%2F40965","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.chair","label":"Chair","values":["Halpern,Joseph Yehuda"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Blume,Lawrence Edward"]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Pass,Rafael N."]},{"key":"dc:creator","label":"Author","values":["Seeman, Lior"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2015-10-15T18:01:41Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2015-10-15T18:01:41Z"]},{"key":"dc:date.issued","label":"Date","values":["2015-08-17"]},{"key":"dc:type","label":"Dc Type","values":["dissertation or thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctor of Philosophy"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph. D., Computer Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Cornell University"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["9255237"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1813/40965"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"cerif:openaire","label":"Cerif Openaire","values":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"ab4ab98c-f690-433e-9f22-e9059343673a\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en_US</Language> <Title>I'M Only Human: Game Theory With Computationally Bounded Agents</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2015-08-17</PublicationDate> <Authors> <Author> <DisplayName>Seeman, Lior</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <Abstract>Rationality in games and decisions is traditionally understood as requiring that agents act optimally. However, as pointed out by Simon [64] acting optimally might be hard. We study how the analysis of games and behaviors changes when agents are assumed to be rational but computationally bounded, and thus cannot always act optimally. We first argue that some observed \"irrational\" human behaviors can be explained by viewing people as computationally bounded agents. We show that adding computation costs into interactive settings have some unintuitive consequences that might lead to behaviors that seem irrational at first. We then consider a dynamic decision problem, and show that some observed human behavior can be actually explained by modeling people as computationally bounded agents that are doing as well as they can, given their limitations. We then develop appropriate models of computationally bounded agents modeled as polynomial-time TM. We study the implications of these models and use these models to analyze different aspect of economic systems. We first develop a model appropriate for a repeated game setting and show that problems that are considered intractable, such as computing a NE in repeated games, actually become tractable in this model. We then develop a model of computational games, which are finite extensive-form games played by computationally bounded players and show an application of this model to the analyzing of cryptographic protocols from a game theoretic perspective.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"]},{"key":"cris:virtual.author","label":"Cris Virtual Author","values":["Seeman, Lior"]},{"key":"cris:virtualsource.collection","label":"Cris Virtualsource Collection","values":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"]},{"key":"dc:description.abstract","label":"Abstract","values":["Rationality in games and decisions is traditionally understood as requiring that agents act optimally. However, as pointed out by Simon [64] acting optimally might be hard. We study how the analysis of games and behaviors changes when agents are assumed to be rational but computationally bounded, and thus cannot always act optimally. We first argue that some observed \"irrational\" human behaviors can be explained by viewing people as computationally bounded agents. We show that adding computation costs into interactive settings have some unintuitive consequences that might lead to behaviors that seem irrational at first. We then consider a dynamic decision problem, and show that some observed human behavior can be actually explained by modeling people as computationally bounded agents that are doing as well as they can, given their limitations. We then develop appropriate models of computationally bounded agents modeled as polynomial-time TM. We study the implications of these models and use these models to analyze different aspect of economic systems. We first develop a model appropriate for a repeated game setting and show that problems that are considered intractable, such as computing a NE in repeated games, actually become tractable in this model. We then develop a model of computational games, which are finite extensive-form games played by computationally bounded players and show an application of this model to the analyzing of cryptographic protocols from a game theoretic perspective."]},{"key":"dc:description.collection","label":"Dc Description Collection","values":["Cornell Theses and Dissertations"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["I'M Only Human: Game Theory With Computationally Bounded Agents"]},{"key":"dspace:entity.type","label":"Dspace Entity Type","values":["Publication"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"cerif:openaire":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"ab4ab98c-f690-433e-9f22-e9059343673a\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en_US</Language> <Title>I'M Only Human: Game Theory With Computationally Bounded Agents</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2015-08-17</PublicationDate> <Authors> <Author> <DisplayName>Seeman, Lior</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <Abstract>Rationality in games and decisions is traditionally understood as requiring that agents act optimally. However, as pointed out by Simon [64] acting optimally might be hard. We study how the analysis of games and behaviors changes when agents are assumed to be rational but computationally bounded, and thus cannot always act optimally. We first argue that some observed \"irrational\" human behaviors can be explained by viewing people as computationally bounded agents. We show that adding computation costs into interactive settings have some unintuitive consequences that might lead to behaviors that seem irrational at first. We then consider a dynamic decision problem, and show that some observed human behavior can be actually explained by modeling people as computationally bounded agents that are doing as well as they can, given their limitations. We then develop appropriate models of computationally bounded agents modeled as polynomial-time TM. We study the implications of these models and use these models to analyze different aspect of economic systems. We first develop a model appropriate for a repeated game setting and show that problems that are considered intractable, such as computing a NE in repeated games, actually become tractable in this model. We then develop a model of computational games, which are finite extensive-form games played by computationally bounded players and show an application of this model to the analyzing of cryptographic protocols from a game theoretic perspective.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"],"cris:virtual.author":["Seeman, Lior"],"cris:virtualsource.collection":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"],"dc:contributor.chair":["Halpern,Joseph Yehuda"],"dc:contributor.committeemember":["Blume,Lawrence Edward"],"dc:contributor.other":["Pass,Rafael N."],"dc:creator":["Seeman, Lior"],"dc:date.accessioned":["2015-10-15T18:01:41Z"],"dc:date.available":["2015-10-15T18:01:41Z"],"dc:date.issued":["2015-08-17"],"dc:description.abstract":["Rationality in games and decisions is traditionally understood as requiring that agents act optimally. However, as pointed out by Simon [64] acting optimally might be hard. We study how the analysis of games and behaviors changes when agents are assumed to be rational but computationally bounded, and thus cannot always act optimally. We first argue that some observed \"irrational\" human behaviors can be explained by viewing people as computationally bounded agents. We show that adding computation costs into interactive settings have some unintuitive consequences that might lead to behaviors that seem irrational at first. We then consider a dynamic decision problem, and show that some observed human behavior can be actually explained by modeling people as computationally bounded agents that are doing as well as they can, given their limitations. We then develop appropriate models of computationally bounded agents modeled as polynomial-time TM. We study the implications of these models and use these models to analyze different aspect of economic systems. We first develop a model appropriate for a repeated game setting and show that problems that are considered intractable, such as computing a NE in repeated games, actually become tractable in this model. We then develop a model of computational games, which are finite extensive-form games played by computationally bounded players and show an application of this model to the analyzing of cryptographic protocols from a game theoretic perspective."],"dc:description.collection":["Cornell Theses and Dissertations"],"dc:format.mimetype":["application/pdf"],"dc:identifier.bibid":["9255237"],"dc:identifier.uri":["https://hdl.handle.net/1813/40965"],"dc:language.iso":["en_US"],"dc:title":["I'M Only Human: Game Theory With Computationally Bounded Agents"],"dc:type":["dissertation or thesis"],"dspace:entity.type":["Publication"],"others:access_status":["open.access"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Doctor of Philosophy"],"thesis:degree_name":["Ph. D., Computer Science"],"thesis:institution_name":["Cornell University"]},"updated_at":"2026-11-19T03:18:46Z"}