{"date_published":"2024-04-05T00:00:00Z","article_processing_charge":"Yes (in subscription journal)","year":"2024","ddc":["000"],"file":[{"checksum":"dbeb123510997886d11925aedbf9c400","creator":"dernst","file_id":"15414","access_level":"open_access","success":1,"relation":"main_file","date_updated":"2024-05-22T07:09:24Z","content_type":"application/pdf","file_size":508191,"file_name":"2024_LNCS_Avni.pdf","date_created":"2024-05-22T07:09:24Z"}],"date_created":"2024-05-12T22:01:02Z","alternative_title":["LNCS"],"publication":"30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems","department":[{"_id":"ToHe"}],"page":"153-172","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","first_name":"Guy","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy"},{"last_name":"Mallik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","orcid":"0000-0001-9864-7475","first_name":"Kaushik","full_name":"Mallik, Kaushik"},{"first_name":"Suman","full_name":"Sadhukhan, Suman","last_name":"Sadhukhan"}],"language":[{"iso":"eng"}],"file_date_updated":"2024-05-22T07:09:24Z","publication_status":"published","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2024-04-06","location":"Luxembourg City, Luxembourg","end_date":"2024-04-11"},"oa":1,"scopus_import":"1","publisher":"Springer Nature","citation":{"short":"G. Avni, K. Mallik, S. Sadhukhan, in:, 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2024, pp. 153–172.","apa":"Avni, G., Mallik, K., &#38; Sadhukhan, S. (2024). Auction-based scheduling. In <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 14572, pp. 153–172). Luxembourg City, Luxembourg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-57256-2_8\">https://doi.org/10.1007/978-3-031-57256-2_8</a>","ama":"Avni G, Mallik K, Sadhukhan S. Auction-based scheduling. In: <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 14572. Springer Nature; 2024:153-172. doi:<a href=\"https://doi.org/10.1007/978-3-031-57256-2_8\">10.1007/978-3-031-57256-2_8</a>","ista":"Avni G, Mallik K, Sadhukhan S. 2024. Auction-based scheduling. 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 14572, 153–172.","chicago":"Avni, Guy, Kaushik Mallik, and Suman Sadhukhan. “Auction-Based Scheduling.” In <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 14572:153–72. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-57256-2_8\">https://doi.org/10.1007/978-3-031-57256-2_8</a>.","ieee":"G. Avni, K. Mallik, and S. Sadhukhan, “Auction-based scheduling,” in <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Luxembourg City, Luxembourg, 2024, vol. 14572, pp. 153–172.","mla":"Avni, Guy, et al. “Auction-Based Scheduling.” <i>30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 14572, Springer Nature, 2024, pp. 153–72, doi:<a href=\"https://doi.org/10.1007/978-3-031-57256-2_8\">10.1007/978-3-031-57256-2_8</a>."},"type":"conference","oa_version":"Published Version","month":"04","title":"Auction-based scheduling","publication_identifier":{"isbn":["9783031572555"],"eissn":["1611-3349"],"issn":["0302-9743"]},"doi":"10.1007/978-3-031-57256-2_8","_id":"15376","quality_controlled":"1","day":"05","abstract":[{"lang":"eng","text":"Sequential decision-making tasks often require satisfaction of multiple, partially-contradictory objectives. Existing approaches are monolithic, where a single policy fulfills all objectives. We present auction-based scheduling, a decentralized framework for multi-objective sequential decision making. Each objective is fulfilled using a separate and independent policy. Composition of policies is performed at runtime, where at each step, the policies simultaneously bid from pre-allocated budgets for the privilege of choosing the next action. The framework allows policies to be independently created, modified, and replaced. We study path planning problems on finite graphs with two temporal objectives and present algorithms to synthesize policies together with bidding policies in a decentralized manner. We consider three categories of decentralized synthesis problems, parameterized by the assumptions that the policies make on each other. We identify a class of assumptions called assume-admissible for which synthesis is always possible for graphs whose every vertex has at most two outgoing edges."}],"status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"date_updated":"2024-05-22T07:14:37Z","intvolume":"     14572","ec_funded":1,"license":"https://creativecommons.org/licenses/by/4.0/","acknowledgement":"This work was supported in part by the ERC project ERC-2020-AdG 101020093 and by ISF grant no. 1679/21.","volume":14572,"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020"}],"external_id":{"arxiv":["2310.11798"]},"has_accepted_license":"1"}