<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-00644528</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-17T07:47:52+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Congestion Pricing Using a Raffle-Based Scheme</title>
            <author role="aut">
              <persName>
                <forename type="first">Patrick</forename>
                <surname>Loiseau</surname>
              </persName>
              <email type="md5">072cb6f491a3d863f4a51b8f6fe68eff</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">patrick-loiseau</idno>
              <idno type="idhal" notation="numeric">751999</idno>
              <idno type="halauthorid" notation="string">12278-751999</idno>
              <idno type="IDREF">https://www.idref.fr/140331387</idno>
              <affiliation ref="#struct-175149"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Galina</forename>
                <surname>Schwartz</surname>
              </persName>
              <email type="md5">4612c2988dbb4915ba45699c33b771cd</email>
              <email type="domain">eecs.berkeley.edu</email>
              <idno type="idhal" notation="numeric">914604</idno>
              <idno type="halauthorid" notation="string">599106-914604</idno>
              <affiliation ref="#struct-26914"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">John</forename>
                <surname>Musacchio</surname>
              </persName>
              <email type="md5">397aab74ab11d87606a5f6e1f3cb2402</email>
              <email type="domain">soe.ucsc.edu</email>
              <idno type="idhal" notation="numeric">914605</idno>
              <idno type="halauthorid" notation="string">577152-914605</idno>
              <affiliation ref="#struct-175149"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Saurabh</forename>
                <surname>Amin</surname>
              </persName>
              <email type="md5">cea954fcd15fd4d06afb83d634eb51fa</email>
              <email type="domain">mit.edu</email>
              <idno type="idhal" notation="numeric">914606</idno>
              <idno type="halauthorid" notation="string">599107-914606</idno>
              <affiliation ref="#struct-301950"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Shankar</forename>
                <forename type="middle">S.</forename>
                <surname>Sastry</surname>
              </persName>
              <email type="md5">0429e723d8f83c1efc0382915057f861</email>
              <email type="domain">eecs.berkeley.edu</email>
              <idno type="idhal" notation="numeric">914607</idno>
              <idno type="halauthorid" notation="string">599108-914607</idno>
              <affiliation ref="#struct-26914"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Ist</forename>
                <surname>Rennes</surname>
              </persName>
              <email type="md5">abc7d42ef58ada3db2afe2195b76dd42</email>
              <email type="domain">inria.fr.invalid</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2011-11-24 15:43:47</date>
              <date type="whenModified">2024-11-19 14:04:08</date>
              <date type="whenReleased">2011-11-25 10:24:33</date>
              <date type="whenProduced">2011-10-12</date>
              <date type="whenEndEmbargoed">2011-11-24</date>
              <ref type="file" target="https://inria.hal.science/hal-00644528v1/document">
                <date notBefore="2011-11-24"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-00644528v1/file/18-NetGCoop11_final_validated.pdf" id="file-644528-406450">
                <date notBefore="2011-11-24"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="437158">
                <persName>
                  <forename>Ist</forename>
                  <surname>Rennes</surname>
                </persName>
                <email type="md5">abc7d42ef58ada3db2afe2195b76dd42</email>
                <email type="domain">inria.fr.invalid</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00644528</idno>
            <idno type="halUri">https://inria.hal.science/hal-00644528</idno>
            <idno type="halBibtex">loiseau:hal-00644528</idno>
            <idno type="halRefHtml">&lt;i&gt;NetGCOOP 2011 : International conference on NETwork Games, COntrol and OPtimization&lt;/i&gt;, Telecom SudParis et Université Paris Descartes, Oct 2011, Paris, France</idno>
            <idno type="halRef">NetGCOOP 2011 : International conference on NETwork Games, COntrol and OPtimization, Telecom SudParis et Université Paris Descartes, Oct 2011, Paris, France</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-644528-406450"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="NETGCOOP2011">NETGCOOP 2011- International conference on NETwork Games, COntrol and OPtimization</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Congestion Pricing Using a Raffle-Based Scheme</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Patrick</forename>
                    <surname>Loiseau</surname>
                  </persName>
                  <email type="md5">072cb6f491a3d863f4a51b8f6fe68eff</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">patrick-loiseau</idno>
                  <idno type="idhal" notation="numeric">751999</idno>
                  <idno type="halauthorid" notation="string">12278-751999</idno>
                  <idno type="IDREF">https://www.idref.fr/140331387</idno>
                  <affiliation ref="#struct-175149"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Galina</forename>
                    <surname>Schwartz</surname>
                  </persName>
                  <email type="md5">4612c2988dbb4915ba45699c33b771cd</email>
                  <email type="domain">eecs.berkeley.edu</email>
                  <idno type="idhal" notation="numeric">914604</idno>
                  <idno type="halauthorid" notation="string">599106-914604</idno>
                  <affiliation ref="#struct-26914"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">John</forename>
                    <surname>Musacchio</surname>
                  </persName>
                  <email type="md5">397aab74ab11d87606a5f6e1f3cb2402</email>
                  <email type="domain">soe.ucsc.edu</email>
                  <idno type="idhal" notation="numeric">914605</idno>
                  <idno type="halauthorid" notation="string">577152-914605</idno>
                  <affiliation ref="#struct-175149"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Saurabh</forename>
                    <surname>Amin</surname>
                  </persName>
                  <email type="md5">cea954fcd15fd4d06afb83d634eb51fa</email>
                  <email type="domain">mit.edu</email>
                  <idno type="idhal" notation="numeric">914606</idno>
                  <idno type="halauthorid" notation="string">599107-914606</idno>
                  <affiliation ref="#struct-301950"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Shankar</forename>
                    <forename type="middle">S.</forename>
                    <surname>Sastry</surname>
                  </persName>
                  <email type="md5">0429e723d8f83c1efc0382915057f861</email>
                  <email type="domain">eecs.berkeley.edu</email>
                  <idno type="idhal" notation="numeric">914607</idno>
                  <idno type="halauthorid" notation="string">599108-914607</idno>
                  <affiliation ref="#struct-26914"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>NetGCOOP 2011 : International conference on NETwork Games, COntrol and OPtimization</title>
                  <date type="start">2011-10-12</date>
                  <date type="end">2011-10-14</date>
                  <settlement>Paris</settlement>
                  <country key="FR">France</country>
                </meeting>
                <respStmt>
                  <resp>conferenceOrganizer</resp>
                  <name>Telecom SudParis et Université Paris Descartes</name>
                </respStmt>
                <editor>Roberto Cominetti and Sylvain Sorin and Bruno Tuffin</editor>
                <imprint>
                  <publisher>IEEE</publisher>
                  <date type="datePub">2011-10-12</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-ni">Computer Science [cs]/Networking and Internet Architecture [cs.NI]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We propose a raffle-based scheme for the decongestion of a shared resource. Our scheme builds on ideas from the economic literature on incentivizing contributions to a public good. We formulate a game-theoretic model for the decongestion problem in a setup with a finite number of users, as well as in a setup with an infinite number of non-atomic users. We analyze both setups, and show that the former converges toward the latter when the number of users becomes large. We compare our results to existing results for the public good provision problem. Overall, our results establish that raffle-based schemes are useful in addressing congestion problems.</p>
            </abstract>
            <particDesc>
              <org type="consortium">Session 05 : Games</org>
              <org type="consortium">Optimization</org>
              <org type="consortium">Pricing</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-175149" status="VALID">
          <orgName>Technology and Information Management [Santa Cruz]</orgName>
          <orgName type="acronym">TIM</orgName>
          <desc>
            <address>
              <addrLine>1156 High Street, Santa Cruz, CA 95064</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">http://tim.soe.ucsc.edu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-111021" type="direct"/>
            <relation active="#struct-471291" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-26914" status="VALID">
          <orgName>Department of Electrical Engineering and Computer Science [Berkeley]</orgName>
          <orgName type="acronym">EECS</orgName>
          <desc>
            <address>
              <addrLine>253 Cory Hall Berkeley, CA 94720-1770</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">http://www.eecs.berkeley.edu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-563719" type="direct"/>
            <relation active="#struct-471291" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-301950" status="VALID">
          <idno type="ROR">https://ror.org/042nb2s44</idno>
          <orgName>Massachusetts Institute of Technology</orgName>
          <orgName type="acronym">MIT</orgName>
          <desc>
            <address>
              <addrLine>77 Massachusetts Ave, Cambridge, MA 02139</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">http://web.mit.edu</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-111021" status="VALID">
          <idno type="ROR">https://ror.org/03s65by71</idno>
          <orgName>University of California [Santa Cruz]</orgName>
          <orgName type="acronym">UC Santa Cruz</orgName>
          <desc>
            <address>
              <addrLine>1156 High Street, Santa Cruz, Ca 95064</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">https://www.ucsc.edu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-471291" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-471291" status="VALID">
          <idno type="ROR">https://ror.org/00pjdza24</idno>
          <orgName>University of California</orgName>
          <orgName type="acronym">UC</orgName>
          <date type="start">1869-01-01</date>
          <desc>
            <address>
              <country key="US"/>
            </address>
            <ref type="url">https://www.universityofcalifornia.edu/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-563719" status="VALID">
          <idno type="ROR">https://ror.org/01an7q238</idno>
          <orgName>University of California [Berkeley]</orgName>
          <orgName type="acronym">UC Berkeley</orgName>
          <desc>
            <address>
              <addrLine>Berkeley, CA</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">https://www.berkeley.edu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-471291" type="direct"/>
          </listRelation>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>