000 05232nam a22006495i 4500
001 978-3-031-15714-1
003 DE-He213
005 20240730165524.0
007 cr nn 008mamaa
008 220913s2022 sz | s |||| 0|eng d
020 _a9783031157141
_9978-3-031-15714-1
024 7 _a10.1007/978-3-031-15714-1
_2doi
050 4 _aQA76.9.C65
072 7 _aUYM
_2bicssc
072 7 _aCOM072000
_2bisacsh
072 7 _aUYM
_2thema
082 0 4 _a003.3
_223
245 1 0 _aAlgorithmic Game Theory
_h[electronic resource] :
_b15th International Symposium, SAGT 2022, Colchester, UK, September 12-15, 2022, Proceedings /
_cedited by Panagiotis Kanellopoulos, Maria Kyropoulou, Alexandros Voudouris.
250 _a1st ed. 2022.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2022.
300 _aXVI, 589 p. 68 illus., 42 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13584
505 0 _aInvited Talk -- Decentralizing Information Technology: The Advent of Resource Based Systems -- Auctions, Markets and Mechanism Design -- How Bad is the Merger Paradox -- Greater Flexibility in Mechanism Design Through Altruism -- Lookahead Auctions with Pooling -- Budget Feasible Mechanisms for Procurement Auctions with Divisible Agents -- On Improved Interval Cover Mechanisms for Crowdsourcing Markets -- Explicitly Simple Near-tie Auctions -- Computational Aspects in Games -- Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy -- Complexity of Public Goods Games on Graphs -- PPAD-Complete Pure Approximate Nash Equilibria in Lipschitz Games -- Seniorities and Minimal Clearing in Financial Network Games -- Financial Networks with Singleton Liability Priorities -- Automated Equilibrium Analysis of 2 2 2 Games -- Congestion and Network Creation Games -- An Improved Bound for the Tree Conjecture in Network Creation Games -- A common generalizationof budget games and congestion games -- Cost-Sharing Games with Rank-Based Utilities -- On Tree Equilibria in Max-Distance Network Creation Games -- On the Impact of Player Capability on Congestion Games -- Data Sharing and Learning -- Learning Approximately Optimal Contracts -- Coopetition Against an Amazon -- Data Curation from Privacy-Aware Agents -- Fast Convergence of Optimistic Gradient Ascent in Network Zero-Sum Extensive Form Games -- Social Choice and Stable Matchings -- Decentralised Update Selection with Semi-Strategic Experts -- Fair ride allocation on a line -- Stable Matching with Multilayer Approval Preferences: Approvals can be Harder than Strict Preferences -- Collective Schedules: Axioms and algorithms -- Justifying Groups in Multiwinner Approval Voting -- Fairness in Temporal Slot Assignment -- Gehrlein Stable Committee with Multi-Modal Preferences. -Online Max-min Fair Allocation -- Incomplete List Setting of the Hospitals/Residents Problem with Maximally Satisfying Lower Quotas -- Strategic Voting in the Context of Stable-Matching of Teams.
520 _aThis book constitutes the proceedings of the 15th International Symposium on Algorithmic Game Theory, SAGT 2022, which took place in Colchester, UK, in September 2022. The 31 full papers included in this book were carefully reviewed and selected from 83 submissions. They were organized in topical sections as follows: Auctions, markets and mechanism design; computational aspects in games; congestion and network creation games; data sharing and learning; social choice and stable matchings.
650 0 _aComputer simulation.
_95106
650 0 _aData structures (Computer science).
_98188
650 0 _aInformation theory.
_914256
650 0 _aApplication software.
_989336
650 0 _aArtificial intelligence.
_93407
650 0 _aAlgorithms.
_93390
650 0 _aComputer networks .
_931572
650 1 4 _aComputer Modelling.
_989337
650 2 4 _aData Structures and Information Theory.
_931923
650 2 4 _aComputer and Information Systems Applications.
_989338
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aDesign and Analysis of Algorithms.
_931835
650 2 4 _aComputer Communication Networks.
_989339
700 1 _aKanellopoulos, Panagiotis.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_989340
700 1 _aKyropoulou, Maria.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_989341
700 1 _aVoudouris, Alexandros.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_989342
710 2 _aSpringerLink (Online service)
_989343
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031157134
776 0 8 _iPrinted edition:
_z9783031157158
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13584
_923263
856 4 0 _uhttps://doi.org/10.1007/978-3-031-15714-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c86367
_d86367