東華大學圖書館 |

Algorithmic game theory = 14th international symposium, SAGT 2021, Aarhus, Denmark, September 21-24, 2021 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Algorithmic game theory/ edited by Ioannis Caragiannis, Kristoffer Arnsfelt Hansen.
Reminder of title:	14th international symposium, SAGT 2021, Aarhus, Denmark, September 21-24, 2021 : proceedings /
remainder title:	SAGT 2021
other author:	Caragiannis, Ioannis.
corporate name:	SAGT (Symposium)
Published:	Cham :Springer International Publishing : : 2021.,
Description:	xxiii, 414 p. :ill. (some col.), digital ;24 cm.
[NT 15003449]:	Auctions and Mechanism Design -- Improved Two Sample Revenue Guarantees via Mixed-Integer Linear Programming -- The Price of Stability of Envy-Free Equilibria in Multi-Buyer Sequential Auctions -- Auctions with Interdependence and SOS: Improved Approximation -- Approximate Mechanism Design for Distributed Facility Location -- Prior-Free Clock Auctions for Bidders with Interdependent Values -- Incentive Compatible Mechanism for Influential Agent Selection -- Computational Aspects of Games -- On Tightness of the Tsaknakis-Spirakis Algorithm for Approximate Nash Equilibrium -- Prophet Inequality with Competing Agents -- Lower Bounds for the Query Complexity of Equilibria in Lipschitz Games- Gerrymandering on graphs: Computational complexity and parameterized algorithms -- Game theory on the blockchain: a model for games with smart contracts -- Algorithmic Challenges in Information Design XVII -- On the Complexity of Nucleolus Computation for Bipartite b-Matching Games -- Pure Nash Equilibria in a Generalization of Congestion Games Allowing Resource Failures -- Markets and Matchings -- On (Coalitional) Exchange-Stable Matching -- Optimal Revenue Guarantees for Pricing in Large Markets -- Approximate Competitive Equilibrium with Generic Budget -- Cost Sharing in Two-Sided Markets -- The Three-Dimensional Stable Roommates Problem with Additively Separable Preferences -- Descending the Stable Matching Lattice: How many Strategic Agents are required to turn Pessimality to Optimality? -- Social Choice and Cooperative Games -- Metric-Distortion Bounds under Limited Information -- Hedonic Expertise Games -- When Dividing Mixed Manna is Easier than Dividing Goods: Competitive Equilibria with a Constant Number of Chores -- Computing Fair and Efficient Allocations with Few Utility Values -- An Approval-Based Model for Single-Step Liquid Democracy -- Two Birds With One Stone: Fairness and Welfare via Transfers -- Pirates in Wonderland: Liquid Democracy has Bicriteria Guarantees -- Abstracts -- On Reward Sharing in Blockchain Mining Pools -- On Submodular Prophet Inequalities and Correlation Gap -- Vote Delegation and Misbehavio.
Contained By:	Springer Nature eBook
Subject:	Game theory - Congresses. -
Online resource:	https://doi.org/10.1007/978-3-030-85947-3
ISBN:	9783030859473

Algorithmic game theory = 14th international symposium, SAGT 2021, Aarhus, Denmark, September 21-24, 2021 : proceedings /
Algorithmic game theory14th international symposium, SAGT 2021, Aarhus, Denmark, September 21-24, 2021 : proceedings /[electronic resource] :SAGT 2021edited by Ioannis Caragiannis, Kristoffer Arnsfelt Hansen. - Cham :Springer International Publishing :2021. - xxiii, 414 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,128850302-9743 ;. - Lecture notes in computer science ;12885..

Auctions and Mechanism Design -- Improved Two Sample Revenue Guarantees via Mixed-Integer Linear Programming -- The Price of Stability of Envy-Free Equilibria in Multi-Buyer Sequential Auctions -- Auctions with Interdependence and SOS: Improved Approximation -- Approximate Mechanism Design for Distributed Facility Location -- Prior-Free Clock Auctions for Bidders with Interdependent Values -- Incentive Compatible Mechanism for Influential Agent Selection -- Computational Aspects of Games -- On Tightness of the Tsaknakis-Spirakis Algorithm for Approximate Nash Equilibrium -- Prophet Inequality with Competing Agents -- Lower Bounds for the Query Complexity of Equilibria in Lipschitz Games- Gerrymandering on graphs: Computational complexity and parameterized algorithms -- Game theory on the blockchain: a model for games with smart contracts -- Algorithmic Challenges in Information Design XVII -- On the Complexity of Nucleolus Computation for Bipartite b-Matching Games -- Pure Nash Equilibria in a Generalization of Congestion Games Allowing Resource Failures -- Markets and Matchings -- On (Coalitional) Exchange-Stable Matching -- Optimal Revenue Guarantees for Pricing in Large Markets -- Approximate Competitive Equilibrium with Generic Budget -- Cost Sharing in Two-Sided Markets -- The Three-Dimensional Stable Roommates Problem with Additively Separable Preferences -- Descending the Stable Matching Lattice: How many Strategic Agents are required to turn Pessimality to Optimality? -- Social Choice and Cooperative Games -- Metric-Distortion Bounds under Limited Information -- Hedonic Expertise Games -- When Dividing Mixed Manna is Easier than Dividing Goods: Competitive Equilibria with a Constant Number of Chores -- Computing Fair and Efficient Allocations with Few Utility Values -- An Approval-Based Model for Single-Step Liquid Democracy -- Two Birds With One Stone: Fairness and Welfare via Transfers -- Pirates in Wonderland: Liquid Democracy has Bicriteria Guarantees -- Abstracts -- On Reward Sharing in Blockchain Mining Pools -- On Submodular Prophet Inequalities and Correlation Gap -- Vote Delegation and Misbehavio.

This book constitutes the refereed proceedings of the 14th International Symposium on Algorithmic Game Theory, SAGT 2021, held in Aarhus, Denmark in September 2021. The 26 full papers presented together with 4 abstract papers were carefully reviewed and selected from 73 submissions. In addition, the volume contains abstracts from 3 invited talks and 2 tutorial talks. The papers are organized in topical sections named: auctions and mechanism design, computational aspects of games, markets and matchings, and social choice and cooperative games.

ISBN: 9783030859473

Standard No.: 10.1007/978-3-030-85947-3doiSubjects--Topical Terms:

658202
Game theory
--Congresses.

LC Class. No.: QA269 / .S34 2021

Dewey Class. No.: 519.3

Algorithmic game theory = 14th international symposium, SAGT 2021, Aarhus, Denmark, September 21-24, 2021 : proceedings /
LDR:03990nmm a2200373 a 4500 001 2301522
003 DE-He213
005 20220112074529.0
006 m d
007 cr nn 008maaau
008 230409s2021 sz s 0 eng d
020 $a 9783030859473 $q (electronic bk.)
020 $a 9783030859466 $q (paper)
024 7 $a 10.1007/978-3-030-85947-3 $2 doi
035 $a 978-3-030-85947-3
035 $a 2301522
040 $a GP $c GP
041 0 $a eng
050 4 $a QA269 $b .S34 2021
072 7 $a UYM $2 bicssc
072 7 $a COM072000 $2 bisacsh
072 7 $a UYM $2 thema
082 0 4 $a 519.3 $2 23
090 $a QA269 $b .S129 2021
111 2 $a SAGT (Symposium) $n (14th : $d 2021 : $c Online) $3 3600995
245 1 0 $a Algorithmic game theory $h [electronic resource] : $b 14th international symposium, SAGT 2021, Aarhus, Denmark, September 21-24, 2021 : proceedings / $c edited by Ioannis Caragiannis, Kristoffer Arnsfelt Hansen.
246 3 $a SAGT 2021
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xxiii, 414 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12885
490 1 $a Information systems and applications, incl. internet/web, and HCI
505 0 $a Auctions and Mechanism Design -- Improved Two Sample Revenue Guarantees via Mixed-Integer Linear Programming -- The Price of Stability of Envy-Free Equilibria in Multi-Buyer Sequential Auctions -- Auctions with Interdependence and SOS: Improved Approximation -- Approximate Mechanism Design for Distributed Facility Location -- Prior-Free Clock Auctions for Bidders with Interdependent Values -- Incentive Compatible Mechanism for Influential Agent Selection -- Computational Aspects of Games -- On Tightness of the Tsaknakis-Spirakis Algorithm for Approximate Nash Equilibrium -- Prophet Inequality with Competing Agents -- Lower Bounds for the Query Complexity of Equilibria in Lipschitz Games- Gerrymandering on graphs: Computational complexity and parameterized algorithms -- Game theory on the blockchain: a model for games with smart contracts -- Algorithmic Challenges in Information Design XVII -- On the Complexity of Nucleolus Computation for Bipartite b-Matching Games -- Pure Nash Equilibria in a Generalization of Congestion Games Allowing Resource Failures -- Markets and Matchings -- On (Coalitional) Exchange-Stable Matching -- Optimal Revenue Guarantees for Pricing in Large Markets -- Approximate Competitive Equilibrium with Generic Budget -- Cost Sharing in Two-Sided Markets -- The Three-Dimensional Stable Roommates Problem with Additively Separable Preferences -- Descending the Stable Matching Lattice: How many Strategic Agents are required to turn Pessimality to Optimality? -- Social Choice and Cooperative Games -- Metric-Distortion Bounds under Limited Information -- Hedonic Expertise Games -- When Dividing Mixed Manna is Easier than Dividing Goods: Competitive Equilibria with a Constant Number of Chores -- Computing Fair and Efficient Allocations with Few Utility Values -- An Approval-Based Model for Single-Step Liquid Democracy -- Two Birds With One Stone: Fairness and Welfare via Transfers -- Pirates in Wonderland: Liquid Democracy has Bicriteria Guarantees -- Abstracts -- On Reward Sharing in Blockchain Mining Pools -- On Submodular Prophet Inequalities and Correlation Gap -- Vote Delegation and Misbehavio.
520 $a This book constitutes the refereed proceedings of the 14th International Symposium on Algorithmic Game Theory, SAGT 2021, held in Aarhus, Denmark in September 2021. The 26 full papers presented together with 4 abstract papers were carefully reviewed and selected from 73 submissions. In addition, the volume contains abstracts from 3 invited talks and 2 tutorial talks. The papers are organized in topical sections named: auctions and mechanism design, computational aspects of games, markets and matchings, and social choice and cooperative games.
650 0 $a Game theory $x Congresses. $3 658202
650 0 $a Algorithms $v Congresses. $3 607038
650 1 4 $a Computer Modelling. $3 3538541
650 2 4 $a Mathematics of Computing. $3 891213
650 2 4 $a Artificial Intelligence. $3 769149
650 2 4 $a Data Structures and Information Theory. $3 3382368
650 2 4 $a Computer Engineering and Networks. $3 3538504
700 1 $a Caragiannis, Ioannis. $3 3600996
700 1 $a Hansen, Kristoffer Arnsfelt. $3 3600997
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 12885. $3 3600998
830 0 $a Information systems and applications, incl. internet/web, and HCI. $3 3382505
856 4 0 $u https://doi.org/10.1007/978-3-030-85947-3
950 $a Computer Science (SpringerNature-11645)