國立虎尾科技大學 |

Algorithmic Game Theory = 14th International Symposium, SAGT 2021, Aarhus, Denmark, September 21–24, 2021, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Algorithmic Game Theory/ edited by Ioannis Caragiannis, Kristoffer Arnsfelt Hansen.
其他題名:	14th International Symposium, SAGT 2021, Aarhus, Denmark, September 21–24, 2021, Proceedings /
其他作者:	Hansen, Kristoffer Arnsfelt.
面頁冊數:	XXIII, 414 p. 34 illus., 18 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computer Systems Organization and Communication Networks. -
電子資源:	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] :edited by Ioannis Caragiannis, Kristoffer Arnsfelt Hansen. - 1st ed. 2021. - XXIII, 414 p. 34 illus., 18 illus. in color.online resource. - Information Systems and Applications, incl. Internet/Web, and HCI ;12885. - Information Systems and Applications, incl. Internet/Web, and HCI ;9149.

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:

669309
Computer Systems Organization and Communication Networks.

LC Class. No.: QA76.9.C65

Dewey Class. No.: 003.3

Algorithmic Game Theory = 14th International Symposium, SAGT 2021, Aarhus, Denmark, September 21–24, 2021, Proceedings /
LDR:04221nam a22004095i 4500 001 1055278
003 DE-He213
005 20211004140946.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030859473 $9 978-3-030-85947-3
024 7 $a 10.1007/978-3-030-85947-3 $2 doi
035 $a 978-3-030-85947-3
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 14th International Symposium, SAGT 2021, Aarhus, Denmark, September 21–24, 2021, Proceedings / $c edited by Ioannis Caragiannis, Kristoffer Arnsfelt Hansen.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XXIII, 414 p. 34 illus., 18 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 Information Systems and Applications, incl. Internet/Web, and HCI ; $v 12885
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 2 4 $a Computer Systems Organization and Communication Networks. $3 669309
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Mathematics of Computing. $3 669457
650 1 4 $a Simulation and Modeling. $3 669249
650 0 $a Computer organization. $3 596298
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Artificial intelligence. $3 559380
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Computer simulation. $3 560190
700 1 $a Hansen, Kristoffer Arnsfelt. $e editor. $1 https://orcid.org/0000-0002-1155-8072 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1360452
700 1 $a Caragiannis, Ioannis. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1074661
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030859466
776 0 8 $i Printed edition: $z 9783030859480
830 0 $a Information Systems and Applications, incl. Internet/Web, and HCI ; $v 9149 $3 1253558
856 4 0 $u https://doi.org/10.1007/978-3-030-85947-3
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)