Atjaunināt sīkdatņu piekrišanu

Frontiers of Algorithmic Wisdom: International Joint Conference, IJTCS-FAW 2022, Hong Kong, China, August 1519, 2022, Revised Selected Papers 1st ed. 2022 [Mīkstie vāki]

Edited by , Edited by
  • Formāts: Paperback / softback, 289 pages, height x width: 235x155 mm, weight: 480 g, 31 Illustrations, color; 21 Illustrations, black and white; XIX, 289 p. 52 illus., 31 illus. in color., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 13461
  • Izdošanas datums: 02-Jan-2023
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 3031207955
  • ISBN-13: 9783031207952
  • Mīkstie vāki
  • Cena: 51,37 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 60,44 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 289 pages, height x width: 235x155 mm, weight: 480 g, 31 Illustrations, color; 21 Illustrations, black and white; XIX, 289 p. 52 illus., 31 illus. in color., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 13461
  • Izdošanas datums: 02-Jan-2023
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 3031207955
  • ISBN-13: 9783031207952
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.
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.