<?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-30T06:25:14Z</responseDate>
  <request identifier="8817" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:8817</identifier>
        <datestamp>2024-03-06T10:42:43Z</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>Uniform Distribution On Pachinko</dc:title>
          <dc:creator>Kitamura, Naoki</dc:creator>
          <dc:creator>Kawabata, Yuya</dc:creator>
          <dc:creator>Izumi, Taisuke</dc:creator>
          <dc:subject>Pachinko</dc:subject>
          <dc:subject>discrete mathematics</dc:subject>
          <dc:description>Pachinko is a japanese mechanical gambling game similar to pinball. Recently, Akitaya et al. proposed several mathematical models of Pachinko. A number of pins are spiked in a field. A ball drops from the top-side end of the playfield, and falls down. In the 50-50 model, if the ball hits a pin, it moves to the left or right of the pin with equal probability. An arrangement of pins generates a distribution of the drop probability over all columns. We consider the problem of generating uniform distributions. Akitaya et al. show that (1/2^{{a}})-uniform distribution is possible for {a} in {0,1,2,3,4} and conjectured that it is possible for any positive integer a. In this paper, we show that the conjecture is true by a constructive way.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Naoki Kitamura and Yuya Kawabata and Taisuke Izumi</dc:contributor>
          <dc:date>2018</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 100, 9th International Conference on Fun with Algorithms (FUN 2018)</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.FUN.2018.26</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-88170</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.26</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
