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.
Reihe
Auflage
Sprache
Verlagsort
Verlagsgruppe
Springer International Publishing
Illustrationen
21 s/w Abbildungen, 31 farbige Abbildungen
XIX, 289 p. 52 illus., 31 illus. in color.
ISBN-13
978-3-031-20796-9 (9783031207969)
DOI
10.1007/978-3-031-20796-9
Schweitzer Klassifikation
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.
