<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>05608nam a22006375i 4500</leader>
  <controlfield tag="001">978-3-031-71033-9</controlfield>
  <controlfield tag="003">DE-He213</controlfield>
  <controlfield tag="005">20251030112935.0</controlfield>
  <controlfield tag="007">cr nn 008mamaa</controlfield>
  <controlfield tag="008">240903s2024    sz |    s    |||| 0|eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9783031710339</subfield>
    <subfield code="9">978-3-031-71033-9</subfield>
  </datafield>
  <datafield tag="024" ind1="7" ind2=" ">
    <subfield code="a">10.1007/978-3-031-71033-9</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="050" ind1=" " ind2="4">
    <subfield code="a">QA76.9.C65</subfield>
  </datafield>
  <datafield tag="072" ind1=" " ind2="7">
    <subfield code="a">UYM</subfield>
    <subfield code="2">bicssc</subfield>
  </datafield>
  <datafield tag="072" ind1=" " ind2="7">
    <subfield code="a">COM072000</subfield>
    <subfield code="2">bisacsh</subfield>
  </datafield>
  <datafield tag="072" ind1=" " ind2="7">
    <subfield code="a">UYM</subfield>
    <subfield code="2">thema</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Algorithmic Game Theory</subfield>
    <subfield code="h">[electronic resource] :</subfield>
    <subfield code="b">17th International Symposium, SAGT 2024, Amsterdam, The Netherlands, September 3&#x2013;6, 2024, Proceedings /</subfield>
    <subfield code="c">edited by Guido Sch&#xE4;fer, Carmine Ventre.</subfield>
  </datafield>
  <datafield tag="250" ind1=" " ind2=" ">
    <subfield code="a">1st ed. 2024.</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
    <subfield code="a">Cham :</subfield>
    <subfield code="b">Springer Nature Switzerland :</subfield>
    <subfield code="b">Imprint: Springer,</subfield>
    <subfield code="c">2024.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">XXI, 546 p. 55 illus., 34 illus. in color.</subfield>
    <subfield code="b">online resource.</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="a">text</subfield>
    <subfield code="b">txt</subfield>
    <subfield code="2">rdacontent</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
    <subfield code="a">computer</subfield>
    <subfield code="b">c</subfield>
    <subfield code="2">rdamedia</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="a">online resource</subfield>
    <subfield code="b">cr</subfield>
    <subfield code="2">rdacarrier</subfield>
  </datafield>
  <datafield tag="347" ind1=" " ind2=" ">
    <subfield code="a">text file</subfield>
    <subfield code="b">PDF</subfield>
    <subfield code="2">rda</subfield>
  </datafield>
  <datafield tag="490" ind1="1" ind2=" ">
    <subfield code="a">Lecture Notes in Computer Science,</subfield>
    <subfield code="x">1611-3349 ;</subfield>
    <subfield code="v">15156</subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2=" ">
    <subfield code="a"> -- The Computational Complexity of the Housing Market.  -- Ex-post Stability under Two-Sided Matching: Complexity and Characterization.  -- Approval-Based Committee Voting under Uncertainty.  -- Matching.  -- Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem.  -- Online Matching with High Probability.  -- The Team Order Problem: Maximizing the Probability of Matching Being Large Enough.  -- Fair Division and Resource Allocation.  -- Fair Division of Chores with Budget Constraints.  -- Fair Division with Interdependent Values.  -- Fair Division with Bounded Sharing: Binary and Non-Degenerate Valuations.  -- Incentives in Dominant Resource Fair Allocation under Dynamic Demands.  -- Mechanism Design.  -- Agent-Constrained Truthful Facility Location Games.  -- The k-Facility Location Problem Via Optimal Transport: A Bayesian Study of the Percentile Mechanisms.  -- Discrete Single-Parameter Optimal Auction Design.  -- Estimating the Expected Social Welfare and Cost of Random Serial Dictatorship.  -- Game Theory and Repeated Games.  -- Swim Till You Sink: Computing the Limit of a Game.  -- The Investment Management Game: Extending the Scope of the Notion of Core.  -- Edge-Dominance Games on Graphs.  -- Playing Repeated Games with Sublinear Randomness.  -- Pricing, Revenue, and Regulation.  -- Mind the Revenue Gap: On the Performance of Approximation Mechanisms under Budget Constraints.  -- Sublogarithmic Approximation for Tollbooth Pricing on a Cactus.  -- To Regulate or Not to Regulate: Using Revenue Maximization Tools to Maximize Consumer Utility.  -- Balancing Participation and Decentralization in Proof-of-Stake Cryptocurrencies.  -- Matroid Theory in Game Theory.  -- Price of Anarchy in Paving Matroid Congestion Games.  -- Price of Anarchy for Graphic Matroid Congestion Games.  -- Non-Adaptive Matroid Prophet Inequalities.  -- Matroid Bayesian Online Selection.  -- Information Sharing and Decision Making.  -- Prediction-Sharing During Training and Inference.  -- Calibrated Recommendations for Users with Decaying Attention.  -- Matrix Rationalization via Partial Orders.  -- Computational Complexity and Resource Allocation.  -- k-Times Bin-Packing and its Application to Fair Electricity Distribution.  -- Condorcet Markets.  -- Complexity of Round-Robin Allocation with Potentially Noisy Queries.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">This volume constitutes the refereed proceedings of 17th International Symposium on Algorithmic Game Theory, SAGT 2024, held in Amsterdam, The Netherlands, during September 3&#x2013;6, 2024. The 29 full papers included in this book were carefully reviewed and selected from 84 submissions. They were organized in topical sections as follows: matching; fair division and resource allocation; mechanism design; game theory and repeated games; pricing, revenue, and regulation; matroid theory in game theory; information sharing and decision making; computational complexity and resource allocation.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Computer simulation.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Data structures (Computer science).</subfield>
    <subfield code="9">66708</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Information theory.</subfield>
    <subfield code="9">57783</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Application software.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Artificial intelligence.</subfield>
    <subfield code="9">58441</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Algorithms.</subfield>
    <subfield code="9">58677</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Computer networks&#xA0;.</subfield>
    <subfield code="9">60157</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="4">
    <subfield code="a">Computer Modelling.</subfield>
    <subfield code="9">65738</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
    <subfield code="a">Data Structures and Information Theory.</subfield>
    <subfield code="9">66709</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
    <subfield code="a">Computer and Information Systems Applications.</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
    <subfield code="a">Artificial Intelligence.</subfield>
    <subfield code="9">58441</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
    <subfield code="a">Design and Analysis of Algorithms.</subfield>
    <subfield code="9">67299</subfield>
  </datafield>
  <datafield tag="650" ind1="2" ind2="4">
    <subfield code="a">Computer Communication Networks.</subfield>
    <subfield code="9">65689</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Sch&#xE4;fer, Guido.</subfield>
    <subfield code="e">editor.</subfield>
    <subfield code="0">(orcid)0000-0002-1923-4902</subfield>
    <subfield code="1">https://orcid.org/0000-0002-1923-4902</subfield>
    <subfield code="4">edt</subfield>
    <subfield code="4">http://id.loc.gov/vocabulary/relators/edt</subfield>
    <subfield code="9">83643</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Ventre, Carmine.</subfield>
    <subfield code="e">editor.</subfield>
    <subfield code="0">(orcid)0000-0003-1464-1215</subfield>
    <subfield code="1">https://orcid.org/0000-0003-1464-1215</subfield>
    <subfield code="4">edt</subfield>
    <subfield code="4">http://id.loc.gov/vocabulary/relators/edt</subfield>
    <subfield code="9">83644</subfield>
  </datafield>
  <datafield tag="710" ind1="2" ind2=" ">
    <subfield code="a">SpringerLink (Online service)</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
    <subfield code="t">Springer Nature eBook</subfield>
  </datafield>
  <datafield tag="776" ind1="0" ind2="8">
    <subfield code="i">Printed edition:</subfield>
    <subfield code="z">9783031710322</subfield>
  </datafield>
  <datafield tag="776" ind1="0" ind2="8">
    <subfield code="i">Printed edition:</subfield>
    <subfield code="z">9783031710346</subfield>
  </datafield>
  <datafield tag="830" ind1=" " ind2="0">
    <subfield code="a">Lecture Notes in Computer Science,</subfield>
    <subfield code="x">1611-3349 ;</subfield>
    <subfield code="v">15156</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
    <subfield code="u">https://doi.org/10.1007/978-3-031-71033-9</subfield>
  </datafield>
  <datafield tag="912" ind1=" " ind2=" ">
    <subfield code="a">ZDB-2-SCS</subfield>
  </datafield>
  <datafield tag="912" ind1=" " ind2=" ">
    <subfield code="a">ZDB-2-SXCS</subfield>
  </datafield>
  <datafield tag="912" ind1=" " ind2=" ">
    <subfield code="a">ZDB-2-LNC</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">63077</subfield>
    <subfield code="d">63077</subfield>
  </datafield>
</record>
