<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="https://www.zbc.uz.zgora.pl/repozytorium/style/common/xsl/oai-style.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/
         http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
	<responseDate>2026-06-28T05:01:11Z</responseDate>
	<request identifier="oai:zbc.uz.zgora.pl:79073" metadataPrefix="oai_dc" verb="GetRecord">
	https://zbc.uz.zgora.pl/repozytorium/oai-pmh-repository.xml</request>
	<GetRecord>
	
  <record>
	<header>
		<identifier>oai:zbc.uz.zgora.pl:79073</identifier>
	    <datestamp>2025-07-14T12:34:36Z</datestamp>
		  <setSpec>DigitalLibraryZielonaGora</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository:Faculties:FacultyComputerElectricalControl</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository:Faculties</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository:TypesWork</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository:TypesWork:Articles</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository:ListJurnals:AMCS:AMCS15</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository:ListJurnals</setSpec> 	      <setSpec>DigitalLibraryZielonaGora:Repository:ListJurnals:AMCS</setSpec> 	    </header>
		<metadata>
	<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title xml:lang="pl"><![CDATA[A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria]]></dc:title>
<dc:creator><![CDATA[Góngora, Pedro A.]]></dc:creator>
<dc:creator><![CDATA[Rosenblueth, David A.]]></dc:creator>
<dc:subject xml:lang="pl"><![CDATA[shortest path]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[Bellman-Ford]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[Nash equilibrium]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[BDD]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[model checking]]></dc:subject>
<dc:description xml:lang="pl"><![CDATA[Consider games where players wish to minimize the cost to reach some state. A subgame-perfect Nash equilibrium can be regarded as a collection of optimal paths on such games. Similarly, the well-known state-labeling algorithm used in model checking can be viewed as computing optimal paths on a Kripke structure, where each path has a minimum number of transitions.]]></dc:description>
<dc:description xml:lang="pl"><![CDATA[We exploit these similarities in a common generalization of extensive games and Kripke structures that we name "graph games". By extending the Bellman-Ford algorithm for computing shortest paths, we obtain a model-checking algorithm for graph games with respect to formulas in an appropriate logic. Hence, when given a certain formula, our model-checking algorithm computes the subgame-perfect Nash equilibrium (as opposed to simply determining whether or not a given collection of paths is a Nash equilibrium).]]></dc:description>
<dc:description xml:lang="pl"><![CDATA[Next, we develop a symbolic version of our model checker allowing us to handle larger graph games. We illustrate our formalism on the critical-path method as well as games with perfect information. Finally, we report on the execution time of benchmarks of an implementation of our algorithms.]]></dc:description>
<dc:publisher><![CDATA[Zielona Góra: Uniwersytet Zielonogórski]]></dc:publisher>
<dc:contributor><![CDATA[Byrski, Aleksander - ed.]]></dc:contributor>
<dc:contributor><![CDATA[Kisiel-Dorohinicki, Marek - ed.]]></dc:contributor>
<dc:contributor><![CDATA[Dobrowolski, Grzegorz - ed.]]></dc:contributor>
<dc:date><![CDATA[2015]]></dc:date>
<dc:type xml:lang="pl"><![CDATA[artykuł]]></dc:type>
<dc:identifier><![CDATA[http://www.zbc.uz.zgora.pl/repozytorium/Content/79073/AMCS_2015_25_3_11.pdf]]></dc:identifier>
<dc:identifier><![CDATA[https://zbc.uz.zgora.pl/repozytorium/dlibra/publication/88904/edition/79073/content]]></dc:identifier>
<dc:identifier><![CDATA[oai:zbc.uz.zgora.pl:79073]]></dc:identifier>
<dc:source xml:lang="pl"><![CDATA[AMCS, volume 25, number 3 (2015)]]></dc:source>
<dc:source xml:lang="pl"><![CDATA[https://www.amcs.uz.zgora.pl/?action=papers&issue=62]]></dc:source>
<dc:language><![CDATA[eng]]></dc:language>
<dc:relation><![CDATA[oai:zbc.uz.zgora.pl:publication:88904]]></dc:relation>
<dc:rights xml:lang="pl"><![CDATA[Biblioteka Uniwersytetu Zielonogórskiego]]></dc:rights>
</oai_dc:dc>

</metadata>
	  </record>	</GetRecord>
</OAI-PMH>
