<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>Congestion Games with Mixed Objectives</title></titleInfo>





<name type="personal">
  <namePart type="given">Matthias</namePart>
  <namePart type="family">Feldotto</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">14052</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0003-1348-6516</description></name>
<name type="personal">
  <namePart type="given">Lennart</namePart>
  <namePart type="family">Leder</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Alexander</namePart>
  <namePart type="family">Skopalik</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">40384</identifier></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">63</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>

<name type="corporate">
  <namePart></namePart>
  <identifier type="local">541</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>





<name type="corporate">
  <namePart>SFB 901</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>
<name type="corporate">
  <namePart>SFB 901 - Subprojekt A3</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>
<name type="corporate">
  <namePart>SFB 901 - Project Area A</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">We study a new class of games which generalizes congestion games and its bottleneck variant. We introduce congestion games with mixed objectives to model network scenarios in which players seek to optimize for latency and bandwidths alike. We characterize the existence of pure Nash equilibria (PNE) and the convergence of improvement dynamics. For games that do not possess PNE we give bounds on the approximation ratio of approximate pure Nash equilibria.</abstract>

<relatedItem type="constituent">
  <location>
    <url displayLabel="Feldotto2016_Chapter_CongestionGamesWithMixedObject.pdf">https://ris.uni-paderborn.de/download/209/5233/Feldotto2016_Chapter_CongestionGamesWithMixedObject.pdf</url>
  </location>
  <physicalDescription><internetMediaType>application/pdf</internetMediaType></physicalDescription>
</relatedItem>
<originInfo><dateIssued encoding="w3cdtf">2016</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</title></titleInfo>
  <identifier type="arXiv">1607.05143</identifier><identifier type="doi">10.1007/978-3-319-48749-6_47</identifier>
<part><extent unit="pages">655--669</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<apa>Feldotto, M., Leder, L., &amp;#38; Skopalik, A. (2016). Congestion Games with Mixed Objectives. In &lt;i&gt;Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)&lt;/i&gt; (pp. 655--669). &lt;a href=&quot;https://doi.org/10.1007/978-3-319-48749-6_47&quot;&gt;https://doi.org/10.1007/978-3-319-48749-6_47&lt;/a&gt;</apa>
<ieee>M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Mixed Objectives,” in &lt;i&gt;Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)&lt;/i&gt;, 2016, pp. 655--669.</ieee>
<chicago>Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” In &lt;i&gt;Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)&lt;/i&gt;, 655--669. LNCS, 2016. &lt;a href=&quot;https://doi.org/10.1007/978-3-319-48749-6_47&quot;&gt;https://doi.org/10.1007/978-3-319-48749-6_47&lt;/a&gt;.</chicago>
<short>M. Feldotto, L. Leder, A. Skopalik, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 655--669.</short>
<mla>Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” &lt;i&gt;Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)&lt;/i&gt;, 2016, pp. 655--669, doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-319-48749-6_47&quot;&gt;10.1007/978-3-319-48749-6_47&lt;/a&gt;.</mla>
<ama>Feldotto M, Leder L, Skopalik A. Congestion Games with Mixed Objectives. In: &lt;i&gt;Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)&lt;/i&gt;. LNCS. ; 2016:655--669. doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-319-48749-6_47&quot;&gt;10.1007/978-3-319-48749-6_47&lt;/a&gt;</ama>
<bibtex>@inproceedings{Feldotto_Leder_Skopalik_2016, series={LNCS}, title={Congestion Games with Mixed Objectives}, DOI={&lt;a href=&quot;https://doi.org/10.1007/978-3-319-48749-6_47&quot;&gt;10.1007/978-3-319-48749-6_47&lt;/a&gt;}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2016}, pages={655--669}, collection={LNCS} }</bibtex>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>209</recordIdentifier><recordCreationDate encoding="w3cdtf">2017-10-17T12:41:32Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2022-01-06T06:54:41Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
