Frontiers of algorithmic wisdom : International Joint Conference, IJTCS-FAW 2022, Hong Kong, China, August 15-19, 2022, Revised selected papers

Frontiers of algorithmic wisdom : International Joint Conference, IJTCS-FAW 2022, Hong Kong, China, August 15-19, 2022, Revised selected papers / Minming Li, Xiaoming Sun (eds.).

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...

Full description

Saved in:
Bibliographic Details
Corporate Author: International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom Hong Kong, China ; Online
Other Authors: Li, Minming (Editor), Sun, Xiaoming (Computer scientist) (Editor)
Format: eBook
Language:English
Published: Cham : Springer, 2022.
Series:Lecture notes in computer science ; 13461.
Subjects:
Computer science > Mathematics > Congresses.
Computer algorithms > Congresses.
Computer algorithms
Computer science > Mathematics
proceedings (reports)
Conference papers and proceedings
Conference papers and proceedings.
Actes de congrès.
Online Access:Click for online access
Table of Contents:
  • 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.

Similar Items