東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁 到查詢結果 [ subject:"Game theory" ]

切換: 標籤 | MARC模式 | ISBD

Algorithmic game theory = 15th Inter...

SAGT (Symposium) (2022 :)

FindBook

Google Book

Amazon

博客來

Algorithmic game theory = 15th International Symposium, SAGT 2022, Colchester, UK, September 12-15, 2022 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Algorithmic game theory/ edited by Panagiotis Kanellopoulos, Maria Kyropoulou, Alexandros Voudouris.
其他題名:	15th International Symposium, SAGT 2022, Colchester, UK, September 12-15, 2022 : proceedings /
其他題名:	SAGT 2022
其他作者:	Kanellopoulos, Panagiotis A.
團體作者:	SAGT (Symposium)
出版者:	Cham :Springer International Publishing : : 2022.,
面頁冊數:	xvi, 589 p. :ill., digital ;24 cm.
內容註:	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.
Contained By:	Springer Nature eBook
標題:	Game theory - Congresses. -
電子資源:	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] :SAGT 2022edited by Panagiotis Kanellopoulos, Maria Kyropoulou, Alexandros Voudouris. - Cham :Springer International Publishing :2022. - xvi, 589 p. :ill., digital ;24 cm. - Lecture notes in computer science,135840302-9743 ;. - Lecture notes in computer science ;13584..

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:

658202
Game theory
--Congresses.

LC Class. No.: QA269 / .S34 2022

Dewey Class. No.: 519.3

Algorithmic game theory = 15th International Symposium, SAGT 2022, Colchester, UK, September 12-15, 2022 : proceedings /
LDR:03772nmm a2200349 a 4500 001 2303926
003 DE-He213
005 20220913181955.0
006 m d
007 cr nn 008maaau
008 230409s2022 sz s 0 eng d
020 $a 9783031157141 $q (electronic bk.)
020 $a 9783031157134 $q (paper)
024 7 $a 10.1007/978-3-031-15714-1 $2 doi
035 $a 978-3-031-15714-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA269 $b .S34 2022
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 2022
111 2 $a SAGT (Symposium) $n (15th : $d 2022 : $c Colchester, England) $3 3605656
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.
246 3 $a SAGT 2022
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a xvi, 589 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $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 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 Data Structures and Information Theory. $3 3382368
650 2 4 $a Computer and Information Systems Applications. $3 3538505
650 2 4 $a Artificial Intelligence. $3 769149
650 2 4 $a Design and Analysis of Algorithms. $3 3538532
650 2 4 $a Computer Communication Networks. $3 775497
700 1 $a Kanellopoulos, Panagiotis A. $3 3605657
700 1 $a Kyropoulou, Maria. $3 3605658
700 1 $a Voudouris, Alexandros. $3 3605659
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 13584. $3 3605660
856 4 0 $u https://doi.org/10.1007/978-3-031-15714-1
950 $a Computer Science (SpringerNature-11645)