Frontiers of Algorithmic Wisdom: International Joint Conference, IJTCS-FAW 2022, Hong Kong, China, August 15–19, 2022, Revised Selected Papers: Lecture Notes in Computer Science, cartea 13461
Editat de Minming Li, Xiaoming Sunen Limba Engleză Paperback – 2 ian 2023
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.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 567.60 lei
- 20% Preț: 238.01 lei
- 15% Preț: 568.74 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 373.56 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 632.22 lei
- 20% Preț: 747.79 lei
- 20% Preț: 1053.45 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 809.19 lei
- 20% Preț: 579.56 lei
- 20% Preț: 649.49 lei
- 20% Preț: 330.23 lei
- Preț: 389.48 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 326.98 lei
- 20% Preț: 256.27 lei
- 20% Preț: 444.17 lei
- 20% Preț: 571.63 lei
- 20% Preț: 575.48 lei
- 20% Preț: 574.05 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 747.79 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 569.19 lei
- 20% Preț: 1159.14 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 354.41 lei
Preț vechi: 443.01 lei
-20% Nou
Puncte Express: 532
Preț estimativ în valută:
67.83€ • 71.16$ • 56.27£
67.83€ • 71.16$ • 56.27£
Carte tipărită la comandă
Livrare economică 29 ianuarie-12 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783031207952
ISBN-10: 3031207955
Pagini: 289
Ilustrații: XIX, 289 p. 52 illus., 31 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.44 kg
Ediția:1st ed. 2022
Editura: Springer International Publishing
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3031207955
Pagini: 289
Ilustrații: XIX, 289 p. 52 illus., 31 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.44 kg
Ediția:1st ed. 2022
Editura: Springer International Publishing
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
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.