<?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">
<ListRecords>
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/oai_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>Dicey games: Shared sources of randomness in distributed systems</dc:title>
   	<dc:title>LIPIcs</dc:title>
   	<dc:creator>Brice, Leonard J</dc:creator>
   	<dc:creator>Henzinger, Thomas A ; https://orcid.org/0000-0002-2985-7724</dc:creator>
   	<dc:creator>Thejaswini, K. S.</dc:creator>
   	<dc:subject>Concurrent games</dc:subject>
   	<dc:subject>Shared randomness</dc:subject>
   	<dc:subject>Topology</dc:subject>
   	<dc:subject>Algebraic Geometry</dc:subject>
   	<dc:subject>ddc:000</dc:subject>
   	<dc:description>Consider a 4-player version of Matching Pennies where a team of three players competes against the Devil. Each player simultaneously says &quot;Heads&quot; or &quot;Tails&quot;. The team wins if all four choices match; otherwise the Devil wins. If all team players randomise independently, they win with probability 1/8; if all players share a common source of randomness, they win with probability 1/2. What happens when each pair of team players shares a source of randomness? Can the team do better than win with probability 1/4? The surprising (and nontrivial) answer is yes!
We introduce Dicey Games, a formal framework motivated by the study of distributed systems with shared sources of randomness (of which the above example is a specific instance). We characterise the existence, representation and computational complexity of optimal strategies in Dicey Games, and we study the problem of allocating limited sources of randomness optimally within a team.</dc:description>
   	<dc:publisher>Schloss Dagstuhl - Leibniz-Zentrum für Informatik</dc:publisher>
   	<dc:date>2026</dc:date>
   	<dc:type>info:eu-repo/semantics/conferenceObject</dc:type>
   	<dc:type>doc-type:conferenceObject</dc:type>
   	<dc:type>text</dc:type>
   	<dc:type>http://purl.org/coar/resource_type/c_5794</dc:type>
   	<dc:identifier>https://research-explorer.ista.ac.at/record/22617</dc:identifier>
   	<dc:identifier>https://research-explorer.ista.ac.at/download/22617/22625</dc:identifier>
   	<dc:source>Brice LJ, Henzinger TA, Thejaswini KS. Dicey games: Shared sources of randomness in distributed systems. In: &lt;i&gt;41st Annual Symposium on Logic in Computer Science&lt;/i&gt;. Vol 380. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:&lt;a href=&quot;https://doi.org/10.4230/LIPIcs.LICS.2026.23&quot;&gt;10.4230/LIPIcs.LICS.2026.23&lt;/a&gt;</dc:source>
   	<dc:language>eng</dc:language>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.LICS.2026.23</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/issn/1868-8969</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/isbn/9783959774345</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/arxiv/2601.18303</dc:relation>
   	<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
</oai_dc:dc>
</ListRecords>
</OAI-PMH>
