國立高雄大學圖資館 |

Language: English

Back

Algorithmic game theory11th Internat...

(1998 :)

Algorithmic game theory11th International Symposium, SAGT 2018, Beijing, China, September 11-14, 2018 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Algorithmic game theoryedited by Xiaotie Deng.
Reminder of title:	11th International Symposium, SAGT 2018, Beijing, China, September 11-14, 2018 : proceedings /
remainder title:	SAGT 2018
other author:	Deng, Xiaotie.
corporate name:
Published:	Cham :Springer International Publishing :2018.
Description:	xx, 276 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Game theoryTextbooks.
Online resource:	http://dx.doi.org/10.1007/978-3-319-99660-8
ISBN:	9783319996608$q(electronic bk.)

Algorithmic game theory11th International Symposium, SAGT 2018, Beijing, China, September 11-14, 2018 : proceedings /
Algorithmic game theory11th International Symposium, SAGT 2018, Beijing, China, September 11-14, 2018 : proceedings /[electronic resource] :SAGT 2018edited by Xiaotie Deng. - Cham :Springer International Publishing :2018. - xx, 276 p. :ill., digital ;24 cm. - Lecture notes in computer science,110590302-9743 ;. - Lecture notes in computer science ;4891..

On Revenue Monotonicity in Combinatorial Auctions -- An Update on the Price of Stability -- Correlation-Robust Mechanism Design -- Job Security, Stability and Production Efficiency, with Applications to Auctions -- A Near Optimal Mechanism for Energy Aware Scheduling -- Information Elicitation for Bayesian Auctions -- The Complexity of Cake Cutting with Unequal Shares -- Resource Based Cooperative Games: Optimization, Fairness and Stability -- Coreness of Cooperative Games with Truncated Submodular Profit Functions -- Strategic Contention Resolution in Multiple Channelswith Limited Feedback -- Simple Games Versus Weighted Voting Games -- Hide and Seek Game with Multiple Resources -- An Improved Envy-Free Cake Cutting Protocol for Four Agents -- A Truthful Mechanism for Interval Scheduling -- On Revenue-Maximizing Mechanisms Assuming Convex Costs -- The Communication Burden of Single Transferable Vote, in Practice -- On the Price of Stability of Social Distance Games -- Schelling Segregation with Strategic Agents -- Efficient Rational Proofs with Strong Utility-Gap Guarantees -- Removal and Threshold Pricing: Truthful Two-sided Markets with Multi-dimensional Participants -- A Two-Stage Mechanism for Ordinal Peer Assessment -- Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance -- The Equilibrium Existence of a Robust Routing Game Under Interval Uncertainty -- Online Trading as a Secretary Problem -- Constrained Swap Dynamics over a Social Network in Distributed Resource Reallocation -- A Hashing Power Allocation Game in Cryptocurrencies among Risk Neutral Miners -- What is the Optimal Deferral Number in Waitlist Mechanism -- An Optimal Strategy for Static Black-Peg Mastermind With Three Pegs -- Tight Bounds on the Relative Performances of Pricing Mechanisms in Storable Good Markets.

This book constitutes the refereed proceedings of the 11th International Symposium on Algorithmic Game Theory, SAGT 2018, held in Beijing, China, in September 2018. The 19 full papers presented together with 6 short papers and 5 plenary talks were carefully reviewed and selected from 54 submissions. The papers cover various important aspects of algorithmic game theory including market equilibrium, auctions and applications, two sided markets, cake-cutting, cooperative games, voting games, multi-agent scheduling, price of stability, various mechanism design problems: online-dynamics and multi-stages as well as revenue maximization and resource allocation and applications.

ISBN: 9783319996608$q(electronic bk.)

Standard No.: 10.1007/978-3-319-99660-8doiSubjects--Topical Terms:

405190
Game theory
--Textbooks.

LC Class. No.: QA269

Dewey Class. No.: 519.3

Algorithmic game theory11th International Symposium, SAGT 2018, Beijing, China, September 11-14, 2018 : proceedings /
LDR:03610nmm a2200337 a 4500 001 543737
003 DE-He213
005 20180826201449.0
006 m d
007 cr nn 008maaau
008 190430s2018 gw s 0 eng d
020 $a 9783319996608$q(electronic bk.)
020 $a 9783319996592$q(paper)
024 7 $a 10.1007/978-3-319-99660-8 $2 doi
035 $a 978-3-319-99660-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA269
072 7 $a UGK $2 bicssc
072 7 $a COM072000 $2 bisacsh
082 0 4 $a 519.3 $2 23
090 $a QA269 $b .S129 2018
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Algorithmic game theory $h [electronic resource] : $b 11th International Symposium, SAGT 2018, Beijing, China, September 11-14, 2018 : proceedings / $c edited by Xiaotie Deng.
246 3 $a SAGT 2018
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a xx, 276 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 11059
505 0 $a On Revenue Monotonicity in Combinatorial Auctions -- An Update on the Price of Stability -- Correlation-Robust Mechanism Design -- Job Security, Stability and Production Efficiency, with Applications to Auctions -- A Near Optimal Mechanism for Energy Aware Scheduling -- Information Elicitation for Bayesian Auctions -- The Complexity of Cake Cutting with Unequal Shares -- Resource Based Cooperative Games: Optimization, Fairness and Stability -- Coreness of Cooperative Games with Truncated Submodular Profit Functions -- Strategic Contention Resolution in Multiple Channelswith Limited Feedback -- Simple Games Versus Weighted Voting Games -- Hide and Seek Game with Multiple Resources -- An Improved Envy-Free Cake Cutting Protocol for Four Agents -- A Truthful Mechanism for Interval Scheduling -- On Revenue-Maximizing Mechanisms Assuming Convex Costs -- The Communication Burden of Single Transferable Vote, in Practice -- On the Price of Stability of Social Distance Games -- Schelling Segregation with Strategic Agents -- Efficient Rational Proofs with Strong Utility-Gap Guarantees -- Removal and Threshold Pricing: Truthful Two-sided Markets with Multi-dimensional Participants -- A Two-Stage Mechanism for Ordinal Peer Assessment -- Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance -- The Equilibrium Existence of a Robust Routing Game Under Interval Uncertainty -- Online Trading as a Secretary Problem -- Constrained Swap Dynamics over a Social Network in Distributed Resource Reallocation -- A Hashing Power Allocation Game in Cryptocurrencies among Risk Neutral Miners -- What is the Optimal Deferral Number in Waitlist Mechanism -- An Optimal Strategy for Static Black-Peg Mastermind With Three Pegs -- Tight Bounds on the Relative Performances of Pricing Mechanisms in Storable Good Markets.
520 $a This book constitutes the refereed proceedings of the 11th International Symposium on Algorithmic Game Theory, SAGT 2018, held in Beijing, China, in September 2018. The 19 full papers presented together with 6 short papers and 5 plenary talks were carefully reviewed and selected from 54 submissions. The papers cover various important aspects of algorithmic game theory including market equilibrium, auctions and applications, two sided markets, cake-cutting, cooperative games, voting games, multi-agent scheduling, price of stability, various mechanism design problems: online-dynamics and multi-stages as well as revenue maximization and resource allocation and applications.
650 0 $a Game theory $v Textbooks. $3 405190
650 0 $a Algorithms $3 253943
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Simulation and Modeling. $3 273719
650 2 4 $a Computer Communication Networks. $3 218087
650 2 4 $a e-Commerce/e-business. $3 348145
650 2 4 $a Coding and Information Theory. $3 273763
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
700 1 $a Deng, Xiaotie. $3 285467
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-99660-8
950 $a Computer Science (Springer-11645)