<?xml version="1.0" encoding="UTF-8"?>
<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-07-22T13:28:16Z</responseDate>
  <request identifier="2330" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2330</identifier>
        <datestamp>2024-03-06T10:33:18Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" 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>Nash Equilibrium in Generalised Muller Games</dc:title>
          <dc:creator>Paul, Soumya</dc:creator>
          <dc:creator>Simon, Sunil</dc:creator>
          <dc:subject>Infinite games on graphs</dc:subject>
          <dc:subject>Muller games</dc:subject>
          <dc:subject>Nash equilibrium</dc:subject>
          <dc:subject>subgame perfect equilibrium</dc:subject>
          <dc:description>We suggest that extending Muller games with preference ordering for&#13;
players is a natural way to reason about unbounded duration games. In&#13;
this context, we look at the standard solution concept of Nash&#13;
equilibrium for non-zero sum games. We show that Nash equilibria&#13;
always exists for such generalised Muller games on finite graphs and&#13;
present a procedure to compute an equilibrium strategy profile. We&#13;
also give a procedure to compute a subgame perfect equilibrium when it&#13;
exists in such games.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Soumya Paul and Sunil Simon</dc:contributor>
          <dc:date>2009</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 4, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.FSTTCS.2009.2330</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-23304</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2330</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
