@article{alaei2014bayesian,
  title={{Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers}},
  author={Alaei, Saeed},
  journal={SIAM Journal on Computing},
  volume={43},
  number={2},
  pages={930--972},
  year={2014},
  publisher={SIAM}
}

@inproceedings{alaei2013online,
  title={{The Online Stochastic Generalized Assignment Problem}},
  author={Alaei, Saeed and Hajiaghayi, MohammadTaghi and Liaghat, Vahid},
  booktitle={Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization},
  pages={11--25},
  year={2013}
}

@article{amil2022multi,
  title={{Multi-Item Order Fulfillment Revisited: LP Formulation and Prophet Inequality}},
  author={Amil, Ayoub and Makhdoumi, Ali and Wei, Yehua},
  journal={Management Science},
volume={0},
  number={0},
pages={1--19},
  year={2025}
}

@article{audibert2009exploration,
  title={Exploration--exploitation tradeoff using variance estimates in multi-armed bandits},
  author={Audibert, Jean-Yves and Munos, R{\'e}mi and Szepesv{\'a}ri, Csaba},
  journal={Theoretical Computer Science},
  volume={410},
  number={19},
  pages={1876--1902},
  year={2009},
  publisher={Elsevier}
}

@article{badanidiyuru2018bandits,
  title={{Bandits with Knapsacks}},
  author={Badanidiyuru, Ashwinkumar and Kleinberg, Robert and Slivkins, Aleksandrs},
  journal={Journal of the ACM},
  volume={65},
  number={3},
  pages={1--55},
  year={2018},
  publisher={ACM New York, NY, USA}
}

@article{bockenhauer2014online,
  title={The online knapsack problem: Advice and randomization},
  author={B{\"o}ckenhauer, Hans-Joachim and Komm, Dennis and Kr{\'a}lovi{\v{c}}, Richard and Rossmanith, Peter},
  journal={Theoretical Computer Science},
  volume={527},
  pages={61--72},
  year={2014},
  publisher={Elsevier}
}

@inproceedings{boodaghians2020pandora,
  title={{Pandora's Box Problem with Order Constraints}},
  author={Boodaghians, Shant and Fusco, Federico and Lazos, Philip and Leonardi, Stefano},
  booktitle={Proceedings of the ACM Conference on Economics and Computation},
  pages={439--458},
  year={2020}
}

@book{boyd2004convex,
  title={Convex Optimization},
  author={Boyd, Stephen P and Vandenberghe, Lieven},
  year={2004},
  publisher={{Cambridge University Press}}
}

@article{buchbinder2009design,
  title={{The Design of Competitive Online Algorithms via a Primal–Dual Approach}},
  author={Buchbinder, Niv and Naor, Joseph Seffi and others},
  journal={Foundations and Trends{\textregistered} in Theoretical Computer Science},
  volume={3},
  number={2--3},
  pages={93--263},
  year={2009},
  publisher={Now Publishers, Inc.}
}

@inproceedings{cao2020optimal,
  title={{Optimal Online Algorithms for One-Way Trading and Online Knapsack Problems: A Unified Competitive Analysis}},
  author={Cao, Ying and Sun, Bo and Tsang, Danny HK},
  booktitle={Proceedings of the IEEE Conference on Decision and Control},
  pages={1064--1069},
  year={2020},
  
}

@inproceedings{chawla2010multi,
  title={{Multi-parameter Mechanism Design
and Sequential Posted Pricing}},
  author={Chawla, Shuchi and Hartline, Jason D and Malec, David L and Sivan, Balasubramanian},
  booktitle={Proceedings of the ACM Symposium on Theory of Computing},
  pages={311--320},
  year={2010}
}

@article{dean2008approximating,
  title={{Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity}},
  author={Dean, Brian C and Goemans, Michel X and Vondr{\'a}k, Jan},
  journal={Mathematics of Operations Research},
  volume={33},
  number={4},
  pages={945--964},
  year={2008},
  publisher={INFORMS}
}

@article{dickerson2021allocation,
  title={{Allocation Problems in Ride-sharing Platforms: Online Matching with Offline Reusable Resources}},
  author={Dickerson, John P and Sankararaman, Karthik A and Srinivasan, Aravind and Xu, Pan},
  journal={ACM Transactions on Economics and Computation},
  volume={9},
  number={3},
  pages={1--17},
  year={2021},
  publisher={ACM New York, NY, USA}
}

@inproceedings{dragobandits,
  title = 	 {{Bandits with Knapsacks and Predictions}},
  author =       {Drago, Davide and Celli, Andrea and Elias, Marek},
  booktitle = 	 {Proceedings of the Conference on Uncertainty in Artificial Intelligence},
  pages = 	 {1189--1206},
  year = 	 {2024},
}

@article{el2001optimal,
  title={{Optimal Search and One-Way Trading Online Algorithms}},
  author={El-Yaniv, Ran and Fiat, Amos and Karp, Richard M and Turpin, Gordon},
  journal={Algorithmica},
  volume={30},
  pages={101--139},
  year={2001},
  publisher={Springer}
}

@inproceedings{esfandiari2019online,
  title={{Online Pandora’s Boxes and Bandits}},
  author={Esfandiari, Hossein and HajiAghayi, MohammadTaghi and Lucier, Brendan and Mitzenmacher, Michael},
  booktitle={Proceedings of the AAAI Conference on Artificial Intelligence},
  pages={1885--1892},
  year={2019}
}

@article{feldman2021online,
  title={{Online Contention Resolution Schemes with Applications to Bayesian Selection Problems}},
  author={Feldman, Moran and Svensson, Ola and Zenklusen, Rico},
  journal={SIAM Journal on Computing},
  volume={50},
  number={2},
  pages={255--300},
  year={2021},
  publisher={SIAM}
}

@inproceedings{garivier2011upper,
  title={{On Upper-Confidence Bound Policies for Switching Bandit Problems}},
  author={Garivier, Aur{\'e}lien and Moulines, Eric},
  booktitle={Proceedings of the International Conference on Algorithmic Learning Theory},
  pages={174--188},
  year={2011},
}

@inproceedings{gatmiry2024bandit,
  title={{Bandit Algorithms for Prophet Inequality and Pandora's Box}},
  author={Gatmiry, Khashayar and Kesselheim, Thomas and Singla, Sahil and Wang, Yifan},
  booktitle={Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms},
  pages={462--500},
  year={2024},
}

@inproceedings{gupta2013stochastic,
  title={{A Stochastic Probing Problem with Applications}},
  author={Gupta, Anupam and Nagarajan, Viswanath},
  booktitle={Proceedings of the International Conference on Integer Programming and Combinatorial Optimization},
  pages={205--216},
  year={2013}
}

@inproceedings{he2016deep,
  title={{Deep Residual Learning for Image Recognition}},
  author={He, Kaiming and Zhang, Xiangyu and Ren, Shaoqing and Sun, Jian},
  booktitle={Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition},
  pages={770--778},
  year={2016}
}

@inproceedings{hung2018videoedge,
  title={{VideoEdge: Processing Camera Streams using Hierarchical Clusters}},
  author={Hung, Chien-Chun and Ananthanarayanan, Ganesh and Bodik, Peter and Golubchik, Leana and Yu, Minlan and Bahl, Paramvir and Philipose, Matthai},
  booktitle={Proceedings of the IEEE/ACM Symposium on Edge Computing},
  pages={115--131},
  year={2018},
  
}

@article{immorlica2022adversarial,
  title={{Adversarial Bandits with Knapsacks}},
  author={Immorlica, Nicole and Sankararaman, Karthik and Schapire, Robert and Slivkins, Aleksandrs},
  journal={Journal of the ACM},
  volume={69},
  number={6},
  pages={1--47},
  year={2022},
  publisher={ACM New York, NY}
}

@inproceedings{jiang2022approximation,
  title={{Approximation Algorithms for Capacitated Assignment with Budget Constraints and Applications in Transportation Systems}},
  author={Jiang, Hongyi and Samaranayake, Samitha},
  booktitle={Proceedings of the International Computing and Combinatorics Conference},
  pages={94--105},
  year={2022},
  
}

@inproceedings{jiang2022tight,
  title={{Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack}},
  author={Jiang, Jiashuo and Ma, Will and Zhang, Jiawei},
  booktitle={Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms},
  pages={1221--1246},
  year={2022}
}

@misc{yolov5,
  title = {YOLOv5 by Ultralytics},
  author = {Glenn Jocher},
  year = {2020},
  version = {7.0},
  license = {AGPL-3.0},
howpublished = "\url{https://github.com/ultralytics/yolov5}",
note = "Accessed: 2024-01-15",
  doi = {10.5281/zenodo.3908559},
  orcid = {0000-0001-5950-6979}
}

@misc{li2023sample,
      title={{Sample-Based Online Generalized Assignment Problem with Unknown Poisson Arrivals}}, 
      author={Li, Zihao and Wang, Hao and Yan, Zhenzhen},
      year={2023},
      eprint={2302.08234},
      archivePrefix={arXiv},
      primaryClass={cs.GT}
}

@article{lin2019competitive,
title={{Competitive Online Optimization under Inventory Constraints}},
  author={Lin, Qiulin and Yi, Hanling and Pang, John and Chen, Minghua and Wierman, Adam and Honig, Michael and Xiao, Yuanzhang},
journal = {SIGMETRICS Perform. Eval. Rev.},
pages = {35–36},
year = {2019},
publisher = {Association for Computing Machinery},
volume = {47},
number = {1},
}

@inproceedings{lin2014microsoft,
  title={{Microsoft COCO: Common Objects in Context}},
  author={Lin, Tsung-Yi and Maire, Michael and Belongie, Serge and Hays, James and Perona, Pietro and Ramanan, Deva and Doll{\'a}r, Piotr and Zitnick, C Lawrence},
  booktitle={Proceedings of the European Conference on Computer Vision},
  pages={740--755},
  year={2014},
  
}

@article{liu2023online,
  title={Online generalized assignment problem with historical information},
  author={Liu, Haodong and Zhang, Huili and Luo, Kelin and Xu, Yao and Xu, Yinfeng and Tong, Weitian},
  journal={Computers \& Operations Research},
  volume={149},
  pages={106047},
  year={2023},
  publisher={Elsevier}
}

@article{mehta2013online,
  title={{Online Matching and Ad Allocation}},
  author={Mehta, Aranyak and others},
  journal={Foundations and Trends{\textregistered} in Theoretical Computer Science},
  volume={8},
  number={4},
  pages={265--368},
  year={2013},
  publisher={Now Publishers, Inc.}
}

@article{morari1999model,
  title={Model predictive control: past, present and future},
  author={Morari, Manfred and Lee, Jay H},
  journal={Computers \& Chemical Engineering},
  volume={23},
  number={4-5},
  pages={667--682},
  year={1999},
  publisher={Elsevier}
}

@article{papastavrou1996dynamic,
  title={{The Dynamic and Stochastic Knapsack Problem with Deadlines}},
  author={Papastavrou, Jason D and Rajagopalan, Srikanth and Kleywegt, Anton J},
  journal={Management Science},
  volume={42},
  number={12},
  pages={1706--1718},
  year={1996},
  publisher={INFORMS}
}

@inproceedings{yolopaper,
  author={Redmon, Joseph and Divvala, Santosh and Girshick, Ross and Farhadi, Ali},
  booktitle={Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition}, 
  title={{You Only Look Once: Unified, Real-Time Object Detection}}, 
  year={2016},
  pages={779-788},
  
}

@article{ren2015faster,
  author={Ren, Shaoqing and He, Kaiming and Girshick, Ross and Sun, Jian},
  journal={IEEE Transactions on Pattern Analysis and Machine Intelligence}, 
  title={{Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks}}, 
  year={2017},
  volume={39},
  number={6},
  pages={1137-1149},
}

@misc{pyrapl,
  author = {Spirals},
  title = {pyRAPL},
  year = {2023},
  howpublished = "\url{https://pypi.org/project/pyRAPL/}",
note = "Accessed: 2024-01-15",
}

@inproceedings{srinivasan2022generalized,
  title={{The Generalized Magician Problem under Unknown Distributions and Related Applications}},
  author={Srinivasan, Aravind and Xu, Pan},
  booktitle={Proceedings of the International Conference on Autonomous Agents and Multiagent Systems},
  pages={1219--1227},
  year={2022}
}

@inproceedings{ijcai2023p607,
  title     = {{Online Task Assignment with Controllable Processing Time}},
  author    = {Wu, Ruoyu and Bao, Wei and Ge, Liming},
  booktitle = {Proceedings of the International Joint Conference on
               Artificial Intelligence},
  pages     = {5466--5474},
  year      = {2023},
}

@misc{yoshinaga2023size,
  title={Size-stochastic Knapsack Online Contention Resolution Schemes},
  author={Yoshinaga, Toru and Kawase, Yasushi},
  journal={arXiv preprint arXiv:2305.08622},
  year={2023},
eprint={2305.08622},
archivePrefix={arXiv},
primaryClass={cs.GT}
}

@inproceedings{zhang2017live,
  title={{Live Video Analytics at Scale with Approximation and Delay-Tolerance}},
  author={Zhang, Haoyu and Ananthanarayanan, Ganesh and Bodik, Peter and Philipose, Matthai and Bahl, Paramvir and Freedman, Michael J},
  booktitle={Proceedings of the USENIX Symposium on Networked Systems Design and Implementation},
pages = {377--392},
  year={2017}
}

@inproceedings{zhou2008budget, 
author = {Zhou, Yunhong and Chakrabarty, Deeparnab and Lukose, Rajan}, 
title = {{Budget Constrained Bidding in Keyword Auctions and Online Knapsack Problems}}, 
year = {2008}, 
booktitle = {Proceedings of the International Conference on World Wide Web}, 
pages = {1243–1244},
}

% Above is ordered



%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

