國立虎尾科技大學 |

Algorithmic Game Theory = 15th International Symposium, SAGT 2022, Colchester, UK, September 12–15, 2022, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Algorithmic Game Theory/ edited by Panagiotis Kanellopoulos, Maria Kyropoulou, Alexandros Voudouris.
Reminder of title:	15th International Symposium, SAGT 2022, Colchester, UK, September 12–15, 2022, Proceedings /
other author:	Kanellopoulos, Panagiotis.
Description:	XVI, 589 p. 68 illus., 42 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computer simulation. -
Online resource:	https://doi.org/10.1007/978-3-031-15714-1
ISBN:	9783031157141

Algorithmic Game Theory = 15th International Symposium, SAGT 2022, Colchester, UK, September 12–15, 2022, Proceedings /
Algorithmic Game Theory15th International Symposium, SAGT 2022, Colchester, UK, September 12–15, 2022, Proceedings /[electronic resource] :edited by Panagiotis Kanellopoulos, Maria Kyropoulou, Alexandros Voudouris. - 1st ed. 2022. - XVI, 589 p. 68 illus., 42 illus. in color.online resource. - Lecture Notes in Computer Science,135841611-3349 ;. - Lecture Notes in Computer Science,9324.

Invited 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 generalization of 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.

This 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.

ISBN: 9783031157141

Standard No.: 10.1007/978-3-031-15714-1doiSubjects--Topical Terms:

560190
Computer simulation.

LC Class. No.: QA76.9.C65

Dewey Class. No.: 003.3

Algorithmic Game Theory = 15th International Symposium, SAGT 2022, Colchester, UK, September 12–15, 2022, Proceedings /
LDR:04099nam a22004095i 4500 001 1083095
003 DE-He213
005 20220913181955.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783031157141 $9 978-3-031-15714-1
024 7 $a 10.1007/978-3-031-15714-1 $2 doi
035 $a 978-3-031-15714-1
050 4 $a QA76.9.C65
072 7 $a UYM $2 bicssc
072 7 $a COM072000 $2 bisacsh
072 7 $a UYM $2 thema
082 0 4 $a 003.3 $2 23
245 1 0 $a Algorithmic Game Theory $h [electronic resource] : $b 15th International Symposium, SAGT 2022, Colchester, UK, September 12–15, 2022, Proceedings / $c edited by Panagiotis Kanellopoulos, Maria Kyropoulou, Alexandros Voudouris.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XVI, 589 p. 68 illus., 42 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Lecture Notes in Computer Science, $x 1611-3349 ; $v 13584
505 0 $a Invited 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 generalization of 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 $a This 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 $a Computer simulation. $3 560190
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Information theory. $3 595305
650 0 $a Application software. $3 528147
650 0 $a Artificial intelligence. $3 559380
650 0 $a Algorithms. $3 527865
650 0 $a Computer networks . $3 1365720
650 1 4 $a Computer Modelling. $3 1365730
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 2 4 $a Computer and Information Systems Applications. $3 1365732
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Design and Analysis of Algorithms. $3 1365721
650 2 4 $a Computer Communication Networks. $3 669310
700 1 $a Kanellopoulos, Panagiotis. $e editor. $1 https://orcid.org/0000-0002-8093-1379 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1388989
700 1 $a Kyropoulou, Maria. $e editor. $1 https://orcid.org/0000-0002-1465-5556 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1388990
700 1 $a Voudouris, Alexandros. $e editor. $1 https://orcid.org/0000-0003-1105-3856 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1388991
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783031157134
776 0 8 $i Printed edition: $z 9783031157158
830 0 $a Lecture Notes in Computer Science, $x 0302-9743 ; $v 9324 $3 1258960
856 4 0 $u https://doi.org/10.1007/978-3-031-15714-1
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)