{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/132744"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/132744","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Distributed learning in games under bounded rationality","abstract":"In multi-agent systems, bounded rationality arises both from the agents’ cognitive and informational limitations and from the uncertainty of the environments in which they interact. This dissertation considers models, solution concepts, and learning dynamics that explicitly embrace bounded rationality as a structural feature. Furthermore, we focus on the inherently distributed nature of these systems, where agents make decisions independently based on local information and individualized models. We study both cooperative and non-cooperative games under these dual perspectives of bounded rationality and distributed decision-making. In the cooperative setting, we show that globally stable and efficient outcomes can emerge from fully distributed dynamics. Focusing on (i) Transferable Utility (TU) coalitional games, (ii) TU B-matchings, and (iii) Non-Transferable Utility (NTU) B-matchings, we extend the classical core solution concept to each structure and design distributed dynamics in which agents rely only on local information and individual payoff aspirations. We prove convergence to the corresponding core, demonstrating that collective order can arise from simple, distributed decision-making. On the non-cooperative side, we advance the empirical evidence equilibrium (EEE) framework as a lens for boundedly rational learning. Within this framework we (i) connect single-agent empirical evidence models to population games, allowing us to leverage evolutionary game theory to prove convergence, (ii) derive explicit contraction and stability condition for weakly-coupled environments, and (iii) introduce exogenous signal games showing empirical evidence equilibria generalize Nash equilibria in perfect-monitoring games. To complement these theoretical contributions, we define independent softmax dynamics as a learning model and illustrate their behavior through simulations across the studied subclasses. Taken together, these results deepen our understanding of how distributed, boundedly rational agents, each acting on limited information and individualized models, can still generate stable and efficient collective outcomes. This perspective reframes uncertainty and bounded rationality as elements that can be constructively incorporated into the design of resilient and adaptive multi-agent systems.","abstract_html":"In multi-agent systems, bounded rationality arises both from the agents’ cognitive and informational limitations and from the uncertainty of the environments in which they interact. This dissertation considers models, solution concepts, and learning dynamics that explicitly embrace bounded rationality as a structural feature. Furthermore, we focus on the inherently distributed nature of these systems, where agents make decisions independently based on local information and individualized models. We study both cooperative and non-cooperative games under these dual perspectives of bounded rationality and distributed decision-making. In the cooperative setting, we show that globally stable and efficient outcomes can emerge from fully distributed dynamics. Focusing on (i) Transferable Utility (TU) coalitional games, (ii) TU B-matchings, and (iii) Non-Transferable Utility (NTU) B-matchings, we extend the classical core solution concept to each structure and design distributed dynamics in which agents rely only on local information and individual payoff aspirations. We prove convergence to the corresponding core, demonstrating that collective order can arise from simple, distributed decision-making. On the non-cooperative side, we advance the empirical evidence equilibrium (EEE) framework as a lens for boundedly rational learning. Within this framework we (i) connect single-agent empirical evidence models to population games, allowing us to leverage evolutionary game theory to prove convergence, (ii) derive explicit contraction and stability condition for weakly-coupled environments, and (iii) introduce exogenous signal games showing empirical evidence equilibria generalize Nash equilibria in perfect-monitoring games. To complement these theoretical contributions, we define independent softmax dynamics as a learning model and illustrate their behavior through simulations across the studied subclasses. Taken together, these results deepen our understanding of how distributed, boundedly rational agents, each acting on limited information and individualized models, can still generate stable and efficient collective outcomes. This perspective reframes uncertainty and bounded rationality as elements that can be constructively incorporated into the design of resilient and adaptive multi-agent systems.","abstract_has_math":false,"creators":["Hamed, Aya"],"institution":"University of Illinois Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Industrial Engineering","degree_department":null,"school":null,"contributors":["Shamma, Jeff S.","Etesami, Seyed R.","Garg, Jugal","Marden, Jason R."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2025,"date_issued":"2025-12","date_published":"2025-12","updated_at":"2026-07-22T22:25:07Z","subjects":["Game Theory","Bounded Rationality","Learning","Distributed dynamics","Cooperative games","Coalitional games","Matching","Stochastic games"],"languages":["en"],"rights":["© 2025 Aya Hamed"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2142/132744","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Shamma, Jeff S.","Etesami, Seyed R.","Garg, Jugal","Marden, Jason R."]},{"key":"dc:creator","label":"Author","values":["Hamed, Aya"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2025-12","2025-10-06"]},{"key":"dc:type","label":"Dc Type","values":["text","Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Industrial Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Game Theory","Bounded Rationality","Learning","Distributed dynamics","Cooperative games","Coalitional games","Matching","Stochastic games"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["© 2025 Aya Hamed"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://hdl.handle.net/2142/132744"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["In multi-agent systems, bounded rationality arises both from the agents’ cognitive and informational limitations and from the uncertainty of the environments in which they interact. This dissertation considers models, solution concepts, and learning dynamics that explicitly embrace bounded rationality as a structural feature. Furthermore, we focus on the inherently distributed nature of these systems, where agents make decisions independently based on local information and individualized models. We study both cooperative and non-cooperative games under these dual perspectives of bounded rationality and distributed decision-making. In the cooperative setting, we show that globally stable and efficient outcomes can emerge from fully distributed dynamics. Focusing on (i) Transferable Utility (TU) coalitional games, (ii) TU B-matchings, and (iii) Non-Transferable Utility (NTU) B-matchings, we extend the classical core solution concept to each structure and design distributed dynamics in which agents rely only on local information and individual payoff aspirations. We prove convergence to the corresponding core, demonstrating that collective order can arise from simple, distributed decision-making. On the non-cooperative side, we advance the empirical evidence equilibrium (EEE) framework as a lens for boundedly rational learning. Within this framework we (i) connect single-agent empirical evidence models to population games, allowing us to leverage evolutionary game theory to prove convergence, (ii) derive explicit contraction and stability condition for weakly-coupled environments, and (iii) introduce exogenous signal games showing empirical evidence equilibria generalize Nash equilibria in perfect-monitoring games. To complement these theoretical contributions, we define independent softmax dynamics as a learning model and illustrate their behavior through simulations across the studied subclasses. Taken together, these results deepen our understanding of how distributed, boundedly rational agents, each acting on limited information and individualized models, can still generate stable and efficient collective outcomes. This perspective reframes uncertainty and bounded rationality as elements that can be constructively incorporated into the design of resilient and adaptive multi-agent systems.","Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2027-12-01","The student, Aya Hamed, accepted the attached license on 2025-09-30 at 15:45.","The student, Aya Hamed, submitted this Dissertation for approval on 2025-09-30 at 21:17.","This Dissertation was approved for publication on 2025-10-06 at 10:38.","DSpace SAF Submission Ingestion Package generated from Vireo submission #22817 on 2026-02-19 at 20:08:31"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Distributed learning in games under bounded rationality"]}]}],"canonical_facts":{"dc:contributor":["Shamma, Jeff S.","Etesami, Seyed R.","Garg, Jugal","Marden, Jason R."],"dc:creator":["Hamed, Aya"],"dc:date":["2025-12","2025-10-06"],"dc:description":["In multi-agent systems, bounded rationality arises both from the agents’ cognitive and informational limitations and from the uncertainty of the environments in which they interact. This dissertation considers models, solution concepts, and learning dynamics that explicitly embrace bounded rationality as a structural feature. Furthermore, we focus on the inherently distributed nature of these systems, where agents make decisions independently based on local information and individualized models. We study both cooperative and non-cooperative games under these dual perspectives of bounded rationality and distributed decision-making. In the cooperative setting, we show that globally stable and efficient outcomes can emerge from fully distributed dynamics. Focusing on (i) Transferable Utility (TU) coalitional games, (ii) TU B-matchings, and (iii) Non-Transferable Utility (NTU) B-matchings, we extend the classical core solution concept to each structure and design distributed dynamics in which agents rely only on local information and individual payoff aspirations. We prove convergence to the corresponding core, demonstrating that collective order can arise from simple, distributed decision-making. On the non-cooperative side, we advance the empirical evidence equilibrium (EEE) framework as a lens for boundedly rational learning. Within this framework we (i) connect single-agent empirical evidence models to population games, allowing us to leverage evolutionary game theory to prove convergence, (ii) derive explicit contraction and stability condition for weakly-coupled environments, and (iii) introduce exogenous signal games showing empirical evidence equilibria generalize Nash equilibria in perfect-monitoring games. To complement these theoretical contributions, we define independent softmax dynamics as a learning model and illustrate their behavior through simulations across the studied subclasses. Taken together, these results deepen our understanding of how distributed, boundedly rational agents, each acting on limited information and individualized models, can still generate stable and efficient collective outcomes. This perspective reframes uncertainty and bounded rationality as elements that can be constructively incorporated into the design of resilient and adaptive multi-agent systems.","Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2027-12-01","The student, Aya Hamed, accepted the attached license on 2025-09-30 at 15:45.","The student, Aya Hamed, submitted this Dissertation for approval on 2025-09-30 at 21:17.","This Dissertation was approved for publication on 2025-10-06 at 10:38.","DSpace SAF Submission Ingestion Package generated from Vireo submission #22817 on 2026-02-19 at 20:08:31"],"dc:format":["application/pdf"],"dc:identifier":["https://hdl.handle.net/2142/132744"],"dc:language":["en"],"dc:rights":["© 2025 Aya Hamed"],"dc:subject":["Game Theory","Bounded Rationality","Learning","Distributed dynamics","Cooperative games","Coalitional games","Matching","Stochastic games"],"dc:title":["Distributed learning in games under bounded rationality"],"dc:type":["text","Thesis"],"thesis:degree_discipline":["Industrial Engineering"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:07Z"}