東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Networking games = network forming g...

Mazalov, Vladimir V.

Linked to FindBook

Google Book

Amazon

博客來

Networking games = network forming games and games on networks /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Networking games/ Vladimir V. Mazalov, Julia V. Chirkova.
Reminder of title:	network forming games and games on networks /
Author:	Mazalov, Vladimir V.
other author:	Chirkova, Julia V.
Published:	London ;Elsevier Academic Press, : 2019.,
Description:	1 online resource (xiii, 308 p.).
[NT 15003449]:	Front Cover; Networking Games; Copyright; Contents; Preface; Introduction; 1 Nash Equilibrium; 1.1 Nash equilibrium; 1.2 Cooperation and competition; 1.3 Examples of load balancing games; 1.4 Convex games; 2 Congestion Games; 2.1 Potential games; 2.2 Congestion games; 2.3 Player-speci c congestion games; 2.4 Congestion games with strategy set constraint; 3 Routing Games; 3.1 The KP-model of optimal routing with unsplittable traf c. The price of anarchy; 3.2 Pure strategy equilibrium. Braess's paradox
[NT 15003449]:	3.3 Completely mixed equilibrium in the problem with inhomogeneous users and homogeneous channels3.4 The price of anarchy in the model with parallel channels and unsplittable traf c; 3.5 The price of anarchy in the model with linear social cost and unsplittable traf c for an arbitrary network; 3.6 The mixed price of anarchy in the model with linear social cost and unsplittable traf c for an arbitrary network; 3.7 The price of anarchy in the model with maximal social cost and unsplittable traf c for an arbitrary network; 3.8 The Wardrop optimal routing model with splittable traf c
[NT 15003449]:	3.9 The optimal routing model with parallel channels. The Pigou model. Braess's paradox3.10 Potential in the model with splittable traf c for an arbitrary network; 3.11 Social cost in the model with splittable traf c for convex latency functions; 3.12 The price of anarchy in the model with splittable traf c for linear latency functions; 3.13 Potential in the Wardrop model with parallel channels for player-speci c linear latency functions; 3.14 The price of anarchy in an arbitrary network for player-speci c linear latency functions
[NT 15003449]:	3.15 The Wardrop model with parallel channels and incomplete information3.16 Equilibria in the model with incomplete information; 3.17 Potential and existence of Wardrop equilibrium in the model with incomplete information; 4 Load Balancing Game; 4.1 A model of the load balancing game; 4.2 The price of anarchy in the general case of N processors; 4.3 The price of anarchy in the case of three processors; 4.4 A numerical method to calculate the price of anarchy; 4.5 Computing experiments; 5 Cover Game; 5.1 A model of the cover game; 5.2 The price of anarchy in the general case of N processors
[NT 15003449]:	5.3 The price of anarchy in the case of three processors5.4 A numerical method to calculate the price of anarchy; 5.5 Computing experiments; 6 Networks and Graphs; 6.1 Classical betweenness centrality for the nodes and edges of a graph; 6.2 The PageRank method; 6.3 Centrality measure for weighted graphs based on Kirchhoff's law; 6.4 Centrality measure for weighted graphs as a solution of cooperative game; 6.4.1 The Myerson value; 6.4.2 Characteristic function; 6.4.3 Allocation principle; 6.4.4 Generating function for the number of paths; 6.4.5 General case
Subject:	Business networks. -
Online resource:	https://www.sciencedirect.com/science/book/9780128165515
ISBN:	9780128165522 (electronic bk.)

Networking games = network forming games and games on networks /
Mazalov, Vladimir V.

Networking gamesnetwork forming games and games on networks /[electronic resource] :Vladimir V. Mazalov, Julia V. Chirkova. - London ;Elsevier Academic Press,2019. - 1 online resource (xiii, 308 p.).

Front Cover; Networking Games; Copyright; Contents; Preface; Introduction; 1 Nash Equilibrium; 1.1 Nash equilibrium; 1.2 Cooperation and competition; 1.3 Examples of load balancing games; 1.4 Convex games; 2 Congestion Games; 2.1 Potential games; 2.2 Congestion games; 2.3 Player-speci c congestion games; 2.4 Congestion games with strategy set constraint; 3 Routing Games; 3.1 The KP-model of optimal routing with unsplittable traf c. The price of anarchy; 3.2 Pure strategy equilibrium. Braess's paradox

Networking Games: Network Forming Games and Games on Networks applies game theory methods to network analyses. Its concentration on rigorous mathematical techniques distinguishes it from other books on game theory. Developed by a mathematician and game theorist with extensive contributions to applied mathematics, game and probability theory, and written for graduate students and professionals, the book's illuminations on network games can be applied to problems in economics (in industrial organization, regulation and competition policy, for instance) and operations research.

ISBN: 9780128165522 (electronic bk.)Subjects--Topical Terms:

601116
Business networks.
Index Terms--Genre/Form:

542853
Electronic books.

LC Class. No.: HD69.S8

Dewey Class. No.: 650.13

Networking games = network forming games and games on networks /
LDR:04300cmm a2200301 a 4500 001 2223576
006 o d
007 cnu|unuuu||
008 210114s2019 enk o 000 0 eng d
020 $a 9780128165522 (electronic bk.)
020 $a 0128165529 (electronic bk.)
020 $a 9780128165515
020 $a 0128165510
035 $a (OCoLC)1082350107
035 $a EL2020306
040 $a YDX $b eng $c YDX $d N$T $d EBLCP $d N$T $d OPELS $d OCLCF $d CNCGM $d WAU $d OCLCQ $d COO $d OCLCQ $d BRF
041 0 $a eng
050 4 $a HD69.S8
082 0 4 $a 650.13 $2 23
100 1 $a Mazalov, Vladimir V. $3 3135001
245 1 0 $a Networking games $h [electronic resource] : $b network forming games and games on networks / $c Vladimir V. Mazalov, Julia V. Chirkova.
260 $a London ; $a San Diego, CA : $b Elsevier Academic Press, $c 2019.
300 $a 1 online resource (xiii, 308 p.).
505 0 $a Front Cover; Networking Games; Copyright; Contents; Preface; Introduction; 1 Nash Equilibrium; 1.1 Nash equilibrium; 1.2 Cooperation and competition; 1.3 Examples of load balancing games; 1.4 Convex games; 2 Congestion Games; 2.1 Potential games; 2.2 Congestion games; 2.3 Player-speci c congestion games; 2.4 Congestion games with strategy set constraint; 3 Routing Games; 3.1 The KP-model of optimal routing with unsplittable traf c. The price of anarchy; 3.2 Pure strategy equilibrium. Braess's paradox
505 8 $a 3.3 Completely mixed equilibrium in the problem with inhomogeneous users and homogeneous channels3.4 The price of anarchy in the model with parallel channels and unsplittable traf c; 3.5 The price of anarchy in the model with linear social cost and unsplittable traf c for an arbitrary network; 3.6 The mixed price of anarchy in the model with linear social cost and unsplittable traf c for an arbitrary network; 3.7 The price of anarchy in the model with maximal social cost and unsplittable traf c for an arbitrary network; 3.8 The Wardrop optimal routing model with splittable traf c
505 8 $a 3.9 The optimal routing model with parallel channels. The Pigou model. Braess's paradox3.10 Potential in the model with splittable traf c for an arbitrary network; 3.11 Social cost in the model with splittable traf c for convex latency functions; 3.12 The price of anarchy in the model with splittable traf c for linear latency functions; 3.13 Potential in the Wardrop model with parallel channels for player-speci c linear latency functions; 3.14 The price of anarchy in an arbitrary network for player-speci c linear latency functions
505 8 $a 3.15 The Wardrop model with parallel channels and incomplete information3.16 Equilibria in the model with incomplete information; 3.17 Potential and existence of Wardrop equilibrium in the model with incomplete information; 4 Load Balancing Game; 4.1 A model of the load balancing game; 4.2 The price of anarchy in the general case of N processors; 4.3 The price of anarchy in the case of three processors; 4.4 A numerical method to calculate the price of anarchy; 4.5 Computing experiments; 5 Cover Game; 5.1 A model of the cover game; 5.2 The price of anarchy in the general case of N processors
505 8 $a 5.3 The price of anarchy in the case of three processors5.4 A numerical method to calculate the price of anarchy; 5.5 Computing experiments; 6 Networks and Graphs; 6.1 Classical betweenness centrality for the nodes and edges of a graph; 6.2 The PageRank method; 6.3 Centrality measure for weighted graphs based on Kirchhoff's law; 6.4 Centrality measure for weighted graphs as a solution of cooperative game; 6.4.1 The Myerson value; 6.4.2 Characteristic function; 6.4.3 Allocation principle; 6.4.4 Generating function for the number of paths; 6.4.5 General case
520 $a Networking Games: Network Forming Games and Games on Networks applies game theory methods to network analyses. Its concentration on rigorous mathematical techniques distinguishes it from other books on game theory. Developed by a mathematician and game theorist with extensive contributions to applied mathematics, game and probability theory, and written for graduate students and professionals, the book's illuminations on network games can be applied to problems in economics (in industrial organization, regulation and competition policy, for instance) and operations research.
650 0 $a Business networks. $3 601116
650 0 $a Social networks. $3 556983
655 4 $a Electronic books. $2 lcsh $3 542853
700 1 $a Chirkova, Julia V. $3 3463182
856 4 0 $u https://www.sciencedirect.com/science/book/9780128165515