Learning-Augmented Mechanism Design: Leveraging Predictions for Facility Location

被引:0
|
作者
Agrawal, Priyank [1 ]
Balkanski, Eric [1 ]
Gkatzelis, Vasilis [2 ]
Ou, Tingting [1 ]
Tan, Xizhi [2 ]
机构
[1] Columbia Univ, Dept Ind Engn & Operat Res, New York, NY 10027 USA
[2] Drexel Univ, Dept Comp Sci, Philadelphia, PA 19104 USA
基金
美国国家科学基金会;
关键词
facility location; mechanisms design with predictions;
D O I
10.1287/moor.2022.0225
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this work, we introduce an alternative model for the design and analysis of strategyproof mechanisms that is motivated by the recent surge of work in "learning augmented algorithms." Aiming to complement the traditional worst-case analysis approach in computer science, this line of work has focused on the design and analysis of algorithms that are enhanced with machine-learned predictions. The algorithms can use the predictions as a guide to inform their decisions, aiming to achieve much stronger performance guarantees when these predictions are accurate (consistency), while also maintaining near-optimal worst-case guarantees, even if these predictions are inaccurate (robustness). We initiate the design and analysis of strategyproof mechanisms that are augmented with predictions regarding the private information of the participating agents. To exhibit the important benefits of this approach, we revisit the canonical problem of facility location with strategic agents in the two-dimensional Euclidean space. We study both the egalitarian and utilitarian social cost functions, and we propose new strategyproof mechanisms that leverage predictions to guarantee an optimal trade-off between consistency and robustness. Furthermore, we also prove parameterized approximation results as a function of the prediction error, showing that our mechanisms perform well, even when the predictions are not fully accurate.
引用
收藏
页码:2626 / 2651
页数:26
相关论文
共 50 条
  • [11] Putting the "Learning" into Learning-Augmented Algorithms for Frequency Estimation
    Du, Elbert
    Wang, Franklyn
    Mitzenmacher, Michael
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139
  • [12] Learning-augmented algorithms for online subset sum
    Xu, Chenyang
    Zhang, Guochuan
    JOURNAL OF GLOBAL OPTIMIZATION, 2023, 87 (2-4) : 989 - 1008
  • [13] Trade-off Analysis in Learning-augmented Algorithms with Societal Design Criteria
    Hajiesmaili M.H.
    Performance Evaluation Review, 2023, 51 (02): : 53 - 58
  • [14] Learning-augmented algorithms for online subset sum
    Chenyang Xu
    Guochuan Zhang
    Journal of Global Optimization, 2023, 87 : 989 - 1008
  • [15] A Regression Approach to Learning-Augmented Online Algorithms
    Anand, Keerti
    Ge, Rong
    Kumar, Amit
    Panigrahi, Debmalya
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [16] Deep Learning-Augmented MRI for Quantitative Imaging
    Wu, Y.
    Du, J.
    Hsu, A.
    Hristov, D.
    Zhao, W.
    Ma, V.
    Chan, M.
    Xing, L.
    MEDICAL PHYSICS, 2018, 45 (06) : E525 - E525
  • [17] Randomized Learning-Augmented Auctions with Revenue Guarantees
    Caragiannis, Ioannis
    Kalantzis, Georgios
    PROCEEDINGS OF THE THIRTY-THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2024, 2024, : 2687 - 2694
  • [18] Robust Learning-Augmented Caching: An Experimental Study
    Chledowski, Jakub
    Polak, Adam
    Szabucki, Bartosz
    Zolna, Konrad
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139
  • [19] Learning-Augmented Algorithms for Online TSP on the Line
    Gouleakis, Themistoklis
    Lakis, Konstantinos
    Shahkarami, Golnoosh
    THIRTY-SEVENTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 37 NO 10, 2023, : 11989 - 11996
  • [20] LearnedSort as a learning-augmented SampleSort: Analysis and Parallelization
    Carvalho, Ivan
    Lawrence, Ramon
    35TH INTERNATIONAL CONFERENCE ON SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT, SSDBM 2023, 2023,