Frontiers of Algorithmic Wisdom [E-Book] : International Joint Conference, IJTCS-FAW 2022, Hong Kong, China, August 15-19, 2022, Revised Selected Papers / edited by Minming Li, Xiaoming Sun.
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 Compu...
Saved in:
Full text |
|
Personal Name(s): | Li, Minming, editor |
Sun, Xiaoming, editor | |
Edition: |
1st edition 2022. |
Imprint: |
Cham :
Springer,
2022
|
Physical Description: |
XIX, 289 pages 52 illustrations, 31 illustrations in color (online resource) |
Note: |
englisch |
ISBN: |
9783031207969 |
DOI: |
10.1007/978-3-031-20796-9 |
Series Title: |
/* Depending on the record driver, $field may either be an array with
"name" and "number" keys or a flat string containing only the series
name. We should account for both cases to maximize compatibility. */?>
Lecture Notes in Computer Science ;
13461 |
Subject (LOC): |
- 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.