LEADER 05434nam 22008295 450 001 9910595042403321 005 20251225203630.0 010 $a9783031157141 010 $a3031157141 024 7 $a10.1007/978-3-031-15714-1 035 $a(MiAaPQ)EBC7084990 035 $a(Au-PeEL)EBL7084990 035 $a(CKB)24819567000041 035 $a(PPN)264952758 035 $a(BIP)85684430 035 $a(BIP)85215809 035 $a(DE-He213)978-3-031-15714-1 035 $a(EXLCZ)9924819567000041 100 $a20220913d2022 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithmic Game Theory $e15th International Symposium, SAGT 2022, Colchester, UK, September 12?15, 2022, Proceedings /$fedited by Panagiotis Kanellopoulos, Maria Kyropoulou, Alexandros Voudouris 205 $a1st ed. 2022. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2022. 215 $a1 online resource (596 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v13584 300 $aIncludes index. 311 08$aPrint version: Kanellopoulos, Panagiotis Algorithmic Game Theory Cham : Springer International Publishing AG,c2022 9783031157134 327 $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. 330 $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. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v13584 606 $aComputer simulation 606 $aData structures (Computer science) 606 $aInformation theory 606 $aApplication software 606 $aArtificial intelligence 606 $aAlgorithms 606 $aComputer networks 606 $aComputer Modelling 606 $aData Structures and Information Theory 606 $aComputer and Information Systems Applications 606 $aArtificial Intelligence 606 $aDesign and Analysis of Algorithms 606 $aComputer Communication Networks 615 0$aComputer simulation. 615 0$aData structures (Computer science) 615 0$aInformation theory. 615 0$aApplication software. 615 0$aArtificial intelligence. 615 0$aAlgorithms. 615 0$aComputer networks. 615 14$aComputer Modelling. 615 24$aData Structures and Information Theory. 615 24$aComputer and Information Systems Applications. 615 24$aArtificial Intelligence. 615 24$aDesign and Analysis of Algorithms. 615 24$aComputer Communication Networks. 676 $a518.1 676 $a519.3 702 $aKyropoulou$b Maria 702 $aKanellopoulos$b Panagiotis 702 $aVoudouris$b Alexandros 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910595042403321 996 $aAlgorithmic game theory$9715330 997 $aUNINA