Frontiers of Algorithmic Wisdom
portes grátis
Frontiers of Algorithmic Wisdom
International Joint Conference, IJTCS-FAW 2022, Hong Kong, China, August 15-19, 2022, Revised Selected Papers
Sun, Xiaoming; Li, Minming
Springer International Publishing AG
01/2023
289
Mole
Inglês
9783031207952
15 a 20 dias
480
Descrição não disponível.
?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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
approximation algorithms;approximation theory;artificial intelligence;computer networks;computer security;computer systems;data communication systems;distributed computer systems;economics;electronic commerce;engineering;game theory;graph theory;mathematics;network protocols;polynomial approximation;signal processing;telecommunication networks;telecommunication systems;theoretical computer science
?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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
approximation algorithms;approximation theory;artificial intelligence;computer networks;computer security;computer systems;data communication systems;distributed computer systems;economics;electronic commerce;engineering;game theory;graph theory;mathematics;network protocols;polynomial approximation;signal processing;telecommunication networks;telecommunication systems;theoretical computer science
