{"id":{"repo_id":"purdue-thes","oai_identifier":"oai:docs.lib.purdue.edu:open_access_dissertations-2648"},"canonical_url":"https://search.dev.ndltd.org/etd/purdue-thes/oai:docs.lib.purdue.edu:open_access_dissertations-2648","repository":{"repo_id":"purdue-thes","name":"Purdue University","base_url":"https://docs.lib.purdue.edu/do/oai/"},"display":{"title":"DECENTRALIZED ALGORITHMS FOR NASH EQUILIBRIUM PROBLEMS – APPLICATIONS TO MULTI-AGENT NETWORK INTERDICTION GAMES AND BEYOND","abstract":"Nash equilibrium problems (NEPs) have gained popularity in recent years in the engineering community due to their ready applicability to a wide variety of practical problems ranging from communication network design to power market analysis. There are strong links between the tools used to analyze NEPs and the classical techniques of nonlinear and combinatorial optimization. However, there remain significant challenges in both the theoretical and algorithmic analysis of NEPs. This dissertation studies certain special classes of NEPs, with the overall purpose of analyzing theoretical properties such as existence and uniqueness, while at the same time proposing decentralized algorithms that provably converge to solutions. The subclasses are motivated by relevant application examples.","abstract_html":"Nash equilibrium problems (NEPs) have gained popularity in recent years in the engineering community due to their ready applicability to a wide variety of practical problems ranging from communication network design to power market analysis. There are strong links between the tools used to analyze NEPs and the classical techniques of nonlinear and combinatorial optimization. However, there remain significant challenges in both the theoretical and algorithmic analysis of NEPs. This dissertation studies certain special classes of NEPs, with the overall purpose of analyzing theoretical properties such as existence and uniqueness, while at the same time proposing decentralized algorithms that provably converge to solutions. The subclasses are motivated by relevant application examples.","abstract_has_math":false,"creators":["Sreekumaran, Harikrishnan"],"institution":null,"degree_name":"Doctor of Philosophy (PhD)","degree_level":"Dissertation","degree_discipline":"Industrial Engineering","degree_department":null,"school":null,"contributors":["ANDREW LU LIU","OMID NOHADANI","MOHIT TAWARMALANI","SATISH UKKUSURI"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-01-01T08:00:00Z","date_published":"2015-01-01T08:00:00Z","updated_at":"2026-07-24T03:54:44Z","subjects":["Distributed optimization","Game theory","Network interdiction","Parallel algorithms"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://docs.lib.purdue.edu/open_access_dissertations/1432","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["ANDREW LU LIU","OMID NOHADANI","MOHIT TAWARMALANI","SATISH UKKUSURI"]},{"key":"dc:creator","label":"Author","values":["Sreekumaran, Harikrishnan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"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":["Doctor of Philosophy (PhD)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Distributed optimization","Game theory","Network interdiction","Parallel algorithms"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://docs.lib.purdue.edu/open_access_dissertations/1432"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Nash equilibrium problems (NEPs) have gained popularity in recent years in the engineering community due to their ready applicability to a wide variety of practical problems ranging from communication network design to power market analysis. There are strong links between the tools used to analyze NEPs and the classical techniques of nonlinear and combinatorial optimization. However, there remain significant challenges in both the theoretical and algorithmic analysis of NEPs. This dissertation studies certain special classes of NEPs, with the overall purpose of analyzing theoretical properties such as existence and uniqueness, while at the same time proposing decentralized algorithms that provably converge to solutions. The subclasses are motivated by relevant application examples."]},{"key":"dc:title","label":"Title","values":["DECENTRALIZED ALGORITHMS FOR NASH EQUILIBRIUM PROBLEMS – APPLICATIONS TO MULTI-AGENT NETWORK INTERDICTION GAMES AND BEYOND"]}]}],"canonical_facts":{"dc:contributor":["ANDREW LU LIU","OMID NOHADANI","MOHIT TAWARMALANI","SATISH UKKUSURI"],"dc:creator":["Sreekumaran, Harikrishnan"],"dc:description.abstract":["Nash equilibrium problems (NEPs) have gained popularity in recent years in the engineering community due to their ready applicability to a wide variety of practical problems ranging from communication network design to power market analysis. There are strong links between the tools used to analyze NEPs and the classical techniques of nonlinear and combinatorial optimization. However, there remain significant challenges in both the theoretical and algorithmic analysis of NEPs. This dissertation studies certain special classes of NEPs, with the overall purpose of analyzing theoretical properties such as existence and uniqueness, while at the same time proposing decentralized algorithms that provably converge to solutions. The subclasses are motivated by relevant application examples."],"dc:identifier":["https://docs.lib.purdue.edu/open_access_dissertations/1432"],"dc:subject":["Distributed optimization","Game theory","Network interdiction","Parallel algorithms"],"dc:title":["DECENTRALIZED ALGORITHMS FOR NASH EQUILIBRIUM PROBLEMS – APPLICATIONS TO MULTI-AGENT NETWORK INTERDICTION GAMES AND BEYOND"],"thesis:degree_discipline":["Industrial Engineering"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Doctor of Philosophy (PhD)"]},"updated_at":"2026-07-24T03:54:44Z"}