<?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-08-10T11:49:36Z</responseDate>
  <request identifier="2968" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2968</identifier>
        <datestamp>2024-03-06T10:28:50Z</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>Resolving Conflicts in Highly Reactive Teams</dc:title>
          <dc:creator>Skubch, Hendrik</dc:creator>
          <dc:creator>Saur, Daniel</dc:creator>
          <dc:creator>Geihs, Kurt</dc:creator>
          <dc:subject>Agents</dc:subject>
          <dc:subject>Multi-agent</dc:subject>
          <dc:subject>cooperation</dc:subject>
          <dc:subject>time critical</dc:subject>
          <dc:subject>conﬂict resolution</dc:subject>
          <dc:description>In distributed cooperation frameworks for completely autonomous agents, conflicts between the involved agents can occur due to inconsistent data available to the agents. In highly dynamic domains, such as RoboCup, it is often neccessary to accept a certain level of conflicts in order to decrease reaction time of single agents, instead of relying on error-free, but extensive communication. However, this may lead to situations in which unresolved conflicts linger and cause cooperation to break down completely. In our cooperation framework, ALICA, we designed and implemented a simple but effective approach to detect these cases and resolve them quickly through a bully algorithm.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Hendrik Skubch and Daniel Saur and Kurt Geihs</dc:contributor>
          <dc:date>2011</dc:date>
          <dc:relation>Is Part Of OASIcs, Volume 17, 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)</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/OASIcs.KiVS.2011.170</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-29687</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.170</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by-nd/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
