000 05471nam a22006975i 4500
001 978-3-031-20796-9
003 DE-He213
005 20240423125055.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 _a9783031207969
_9978-3-031-20796-9
024 7 _a10.1007/978-3-031-20796-9
_2doi
050 4 _aQA76.9.M35
050 4 _aQA297.4
072 7 _aUYAM
_2bicssc
072 7 _aPBD
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
072 7 _aPBD
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aFrontiers of Algorithmic Wisdom
_h[electronic resource] :
_bInternational Joint Conference, IJTCS-FAW 2022, Hong Kong, China, August 15–19, 2022, Revised Selected Papers /
_cedited by Minming Li, Xiaoming Sun.
250 _a1st ed. 2022.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2022.
300 _aXIX, 289 p. 52 illus., 31 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13461
505 0 _aAlgorithmic 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 _aThis 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 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aNumerical analysis.
650 0 _aData structures (Computer science).
650 0 _aInformation theory.
650 0 _aComputer engineering.
650 0 _aComputer networks .
650 0 _aSoftware engineering.
650 0 _aAlgorithms.
650 1 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aNumerical Analysis.
650 2 4 _aData Structures and Information Theory.
650 2 4 _aComputer Engineering and Networks.
650 2 4 _aSoftware Engineering.
650 2 4 _aDesign and Analysis of Algorithms.
700 1 _aLi, Minming.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSun, Xiaoming.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031207952
776 0 8 _iPrinted edition:
_z9783031207976
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13461
856 4 0 _uhttps://doi.org/10.1007/978-3-031-20796-9
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c173930
_d173930