東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Frontiers of algorithmic wisdom = in...

International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom ((2022 :)

FindBook

Google Book

Amazon

博客來

Frontiers of algorithmic wisdom = international Joint Conference, IJTCS-FAW 2022, Hong Kong, China, August 15-19, 2022 : revised selected papers /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Frontiers of algorithmic wisdom/ edited by Minming Li, Xiaoming Sun.
其他題名:	international Joint Conference, IJTCS-FAW 2022, Hong Kong, China, August 15-19, 2022 : revised selected papers /
其他題名:	IJTCS-FAW 2022
其他作者:	Li, Minming.
團體作者:	International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom
出版者:	Cham :Springer International Publishing : : 2022.,
面頁冊數:	xix, 289 p. :ill. (some col.), digital ;24 cm.
內容註:	Algorithmic Game Theory -- EFX under Budget Constraint -- Two-Facility Location Game with Distance Requirement -- Constrained Heterogeneous Two-facility Location Games with Max-variant Cost -- Optimally Integrating Ad Auction into E-Commerce Platforms -- Verifiable Crowd Computing: Coping with Bounded Rationality -- Game Theory in Block Chain -- Equilibrium analysis of block withholding attack: an evolutionary game perspective -- Frontiers of Algorithmic Wisdom -- An approximation algorithm for the H-prize-collecting power cover problem -- Online early work maximization on three hierarchical machines with a common due date -- Secure Computations through Checking Suits of Playing Cards -- Streaming Submodular Maximization with the Chance Constraint -- Colorful Graph Coloring -- On the Transversal Number of Rank k Hypergraphs -- Exact Algorithms and Hardness Results for Geometric Red-Blue Hitting Set Problem -- Bounds for the Oriented Diameter of Planar Triangulations -- String Rearrangement Inequalities and a Total Order Between Primitive Words -- Approximation Algorithms for Prize-Collecting Capacitated Network Design Problems -- Computational and Network Economics -- Possible and Necessary Winner Problems in Iterative Elections with Multiple Rules -- A Mechanism Design Approach for Multi-Party Machine Learning -- Budget-Feasible Sybil-Proof Mechanisms for Crowdsensing.
Contained By:	Springer Nature eBook
標題:	Computer science - Mathematics -
電子資源:	https://doi.org/10.1007/978-3-031-20796-9
ISBN:	9783031207969

Frontiers of algorithmic wisdom = international Joint Conference, IJTCS-FAW 2022, Hong Kong, China, August 15-19, 2022 : revised selected papers /
Frontiers of algorithmic wisdominternational Joint Conference, IJTCS-FAW 2022, Hong Kong, China, August 15-19, 2022 : revised selected papers /[electronic resource] :IJTCS-FAW 2022edited by Minming Li, Xiaoming Sun. - Cham :Springer International Publishing :2022. - xix, 289 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,134610302-9743 ;. - Lecture notes in computer science ;13461..

Algorithmic Game Theory -- EFX under Budget Constraint -- Two-Facility Location Game with Distance Requirement -- Constrained Heterogeneous Two-facility Location Games with Max-variant Cost -- Optimally Integrating Ad Auction into E-Commerce Platforms -- Verifiable Crowd Computing: Coping with Bounded Rationality -- Game Theory in Block Chain -- Equilibrium analysis of block withholding attack: an evolutionary game perspective -- Frontiers of Algorithmic Wisdom -- An approximation algorithm for the H-prize-collecting power cover problem -- Online early work maximization on three hierarchical machines with a common due date -- Secure Computations through Checking Suits of Playing Cards -- Streaming Submodular Maximization with the Chance Constraint -- Colorful Graph Coloring -- On the Transversal Number of Rank k Hypergraphs -- Exact Algorithms and Hardness Results for Geometric Red-Blue Hitting Set Problem -- Bounds for the Oriented Diameter of Planar Triangulations -- String Rearrangement Inequalities and a Total Order Between Primitive Words -- Approximation Algorithms for Prize-Collecting Capacitated Network Design Problems -- Computational and Network Economics -- Possible and Necessary Winner Problems in Iterative Elections with Multiple Rules -- A Mechanism Design Approach for Multi-Party Machine Learning -- Budget-Feasible Sybil-Proof Mechanisms for Crowdsensing.

This book constitutes the proceedings of the International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom (IJTCS-FAW 2022), for the 16th International Conference on Frontier of Algorithmic Wisdom (FAW) and the third International Joint Conference on Theoretical Computer Science (IJTCS), held in Hong Kong, China, in August 15-19 2022. FAW started as the Frontiers of Algorithmic Workshop in 2007 at Lanzhou, China, and was held annually from 2007 to 2021 and published archival proceedings. IJTCS, the International joint theoretical Computer Science Conference, started in 2020, aimed to bring in presentations covering active topics in selected tracks in theoretical computer science. To accommodate the diversified new research directions in theoretical computer science, FAW and IJTCS joined their forces together to organize an event for information exchange of new findings and work of enduring value in the field. In addition to four keynote speakers, 26 invited speakers and 19 contributed speakers, IJTCS-FAW2022 organized Forums for undergraduate research, young PhD graduates, young TCS faculty members, female researchers, as well as a forum in Conscious AI and a CSIAM Forum in blockchain. The 19 full papers presented in this book were carefully reviewed and selected from 25 submissions. They were organized in topical sections as follows: Algorithmic Game Theory; Game Theory in Block Chain; Frontiers of Algorithmic Wisdom; Computational and Network Economics.

ISBN: 9783031207969

Standard No.: 10.1007/978-3-031-20796-9doiSubjects--Topical Terms:

678603
Computer science
--Mathematics

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Frontiers of algorithmic wisdom = international Joint Conference, IJTCS-FAW 2022, Hong Kong, China, August 15-19, 2022 : revised selected papers /
LDR:04150nmm a2200373 a 4500 001 2306839
003 DE-He213
005 20221228193417.0
006 m d
007 cr nn 008maaau
008 230421s2022 sz s 0 eng d
020 $a 9783031207969 $q (electronic bk.)
020 $a 9783031207952 $q (paper)
024 7 $a 10.1007/978-3-031-20796-9 $2 doi
035 $a 978-3-031-20796-9
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.M35
072 7 $a UYAM $2 bicssc
072 7 $a PBD $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a UYAM $2 thema
072 7 $a PBD $2 thema
082 0 4 $a 004.0151 $2 23
090 $a QA76.9.M35 $b I61 2022
111 2 $a International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom $d (2022 : $c Hong Kong, China ; Online) $3 3611473
245 1 0 $a Frontiers of algorithmic wisdom $h [electronic resource] : $b international Joint Conference, IJTCS-FAW 2022, Hong Kong, China, August 15-19, 2022 : revised selected papers / $c edited by Minming Li, Xiaoming Sun.
246 3 $a IJTCS-FAW 2022
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a xix, 289 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 13461
505 0 $a Algorithmic Game Theory -- EFX under Budget Constraint -- Two-Facility Location Game with Distance Requirement -- Constrained Heterogeneous Two-facility Location Games with Max-variant Cost -- Optimally Integrating Ad Auction into E-Commerce Platforms -- Verifiable Crowd Computing: Coping with Bounded Rationality -- Game Theory in Block Chain -- Equilibrium analysis of block withholding attack: an evolutionary game perspective -- Frontiers of Algorithmic Wisdom -- An approximation algorithm for the H-prize-collecting power cover problem -- Online early work maximization on three hierarchical machines with a common due date -- Secure Computations through Checking Suits of Playing Cards -- Streaming Submodular Maximization with the Chance Constraint -- Colorful Graph Coloring -- On the Transversal Number of Rank k Hypergraphs -- Exact Algorithms and Hardness Results for Geometric Red-Blue Hitting Set Problem -- Bounds for the Oriented Diameter of Planar Triangulations -- String Rearrangement Inequalities and a Total Order Between Primitive Words -- Approximation Algorithms for Prize-Collecting Capacitated Network Design Problems -- Computational and Network Economics -- Possible and Necessary Winner Problems in Iterative Elections with Multiple Rules -- A Mechanism Design Approach for Multi-Party Machine Learning -- Budget-Feasible Sybil-Proof Mechanisms for Crowdsensing.
520 $a This book constitutes the proceedings of the International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom (IJTCS-FAW 2022), for the 16th International Conference on Frontier of Algorithmic Wisdom (FAW) and the third International Joint Conference on Theoretical Computer Science (IJTCS), held in Hong Kong, China, in August 15-19 2022. FAW started as the Frontiers of Algorithmic Workshop in 2007 at Lanzhou, China, and was held annually from 2007 to 2021 and published archival proceedings. IJTCS, the International joint theoretical Computer Science Conference, started in 2020, aimed to bring in presentations covering active topics in selected tracks in theoretical computer science. To accommodate the diversified new research directions in theoretical computer science, FAW and IJTCS joined their forces together to organize an event for information exchange of new findings and work of enduring value in the field. In addition to four keynote speakers, 26 invited speakers and 19 contributed speakers, IJTCS-FAW2022 organized Forums for undergraduate research, young PhD graduates, young TCS faculty members, female researchers, as well as a forum in Conscious AI and a CSIAM Forum in blockchain. The 19 full papers presented in this book were carefully reviewed and selected from 25 submissions. They were organized in topical sections as follows: Algorithmic Game Theory; Game Theory in Block Chain; Frontiers of Algorithmic Wisdom; Computational and Network Economics.
650 0 $a Computer science $x Mathematics $x Congresses. $3 678603
650 0 $a Computer algorithms $x Congresses. $3 576357
700 1 $a Li, Minming. $3 3503801
700 1 $a Sun, Xiaoming. $3 3338083
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 13461. $3 3611474
856 4 0 $u https://doi.org/10.1007/978-3-031-20796-9
950 $a Computer Science (SpringerNature-11645)