default search action
IJTCS-FAW 2022: Hong Kong, China
- Minming Li, Xiaoming Sun:
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 13461, Springer 2022, ISBN 978-3-031-20795-2
Algorithmic Game Theory
- Sijia Dai, Guichen Gao, Shengxin Liu, Boon-Han Lim, Li Ning, Yicheng Xu, Yong Zhang:
EFX Under Budget Constraint. 3-14 - Ling Gai, Dandan Qian, Chenchen Wu:
Two-Facility Location Games with Distance Requirement. 15-24 - Qi Zhao, Wenjing Liu, Qizhi Fang, Qingqin Nong:
Constrained Heterogeneous Two-Facility Location Games with Max-Variant Cost. 25-43 - Weian Li, Qi Qi, Changjun Wang, Changyuan Yu:
Optimally Integrating Ad Auction into E-Commerce Platforms. 44-58 - Lu Dong, Miguel A. Mosteiro, Shikha Singh:
Verifiable Crowd Computing: Coping with Bounded Rationality. 59-78
Game Theory in Block Chain
- Zhanghao Yao, Yukun Cheng, Zhiqi Xu:
Equilibrium Analysis of Block Withholding Attack: An Evolutionary Game Perspective. 81-86
Frontiers of Algorithmic Wisdom
- Han Dai, Weidong Li, Xiaofei Liu:
An Approximation Algorithm for the H-Prize-Collecting Power Cover Problem. 89-98 - Man Xiao, Weidong Li:
Online Early Work Maximization on Three Hierarchical Machines with a Common Due Date. 99-109 - Daiki Miyahara, Takaaki Mizuki:
Secure Computations Through Checking Suits of Playing Cards. 110-128 - Shufang Gong, Bin Liu, Qizhi Fang:
Streaming Submodular Maximization with the Chance Constraint. 129-140 - Zhongyi Zhang, Jiong Guo:
Colorful Graph Coloring. 141-161 - Zhongzheng Tang, Zhuo Diao:
On the Transversal Number of Rank k Hypergraphs. 162-175 - Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit:
Exact Algorithms and Hardness Results for Geometric Red-Blue Hitting Set Problem. 176-191 - Debajyoti Mondal, N. Parthiban, Indra Rajasingh:
Bounds for the Oriented Diameter of Planar Triangulations. 192-205 - Ruixi Luo, Taikun Zhu, Kai Jin:
String Rearrangement Inequalities and a Total Order Between Primitive Words. 206-218 - Lu Han, Vincent Chau, Chi Kit Ken Fong:
Approximation Algorithms for Prize-Collecting Capacitated Network Design Problems. 219-232
Computational and Network Economics
- Peihua Li, Jiong Guo:
Possible and Necessary Winner Problems in Iterative Elections with Multiple Rules. 235-247 - Mengjing Chen, Yang Liu, Weiran Shen, Yiheng Shen, Pingzhong Tang, Qiang Yang:
A Mechanism Design Approach for Multi-party Machine Learning. 248-268 - Xiang Liu, Weiwei Wu, Wanyuan Wang, Yuhang Xu, Xiumin Wang, Helei Cui:
Budget-Feasible Sybil-Proof Mechanisms for Crowdsensing. 269-288
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.