{"isi":1,"volume":119,"intvolume":"       119","year":"2021","article_type":"original","citation":{"apa":"Avni, G., Henzinger, T. A., &#38; Žikelić, Đ. (2021). Bidding mechanisms in graph games. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jcss.2021.02.008\">https://doi.org/10.1016/j.jcss.2021.02.008</a>","chicago":"Avni, Guy, Thomas A Henzinger, and Đorđe Žikelić. “Bidding Mechanisms in Graph Games.” <i>Journal of Computer and System Sciences</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.jcss.2021.02.008\">https://doi.org/10.1016/j.jcss.2021.02.008</a>.","ista":"Avni G, Henzinger TA, Žikelić Đ. 2021. Bidding mechanisms in graph games. Journal of Computer and System Sciences. 119(8), 133–144.","ama":"Avni G, Henzinger TA, Žikelić Đ. Bidding mechanisms in graph games. <i>Journal of Computer and System Sciences</i>. 2021;119(8):133-144. doi:<a href=\"https://doi.org/10.1016/j.jcss.2021.02.008\">10.1016/j.jcss.2021.02.008</a>","short":"G. Avni, T.A. Henzinger, Đ. Žikelić, Journal of Computer and System Sciences 119 (2021) 133–144.","mla":"Avni, Guy, et al. “Bidding Mechanisms in Graph Games.” <i>Journal of Computer and System Sciences</i>, vol. 119, no. 8, Elsevier, 2021, pp. 133–44, doi:<a href=\"https://doi.org/10.1016/j.jcss.2021.02.008\">10.1016/j.jcss.2021.02.008</a>.","ieee":"G. Avni, T. A. Henzinger, and Đ. Žikelić, “Bidding mechanisms in graph games,” <i>Journal of Computer and System Sciences</i>, vol. 119, no. 8. Elsevier, pp. 133–144, 2021."},"_id":"9239","language":[{"iso":"eng"}],"publication":"Journal of Computer and System Sciences","author":[{"orcid":"0000-0001-5588-8287","last_name":"Avni","first_name":"Guy","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"},{"full_name":"Žikelić, Đorđe","last_name":"Žikelić","first_name":"Đorđe"}],"page":"133-144","doi":"10.1016/j.jcss.2021.02.008","publication_identifier":{"issn":["0022-0000"],"eissn":["1090-2724"]},"external_id":{"arxiv":["1905.03835"],"isi":["000634149800009"]},"status":"public","related_material":{"record":[{"relation":"earlier_version","id":"6884","status":"public"}]},"quality_controlled":"1","title":"Bidding mechanisms in graph games","date_created":"2021-03-14T23:01:32Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Preprint","oa":1,"scopus_import":"1","publisher":"Elsevier","issue":"8","date_published":"2021-03-03T00:00:00Z","publication_status":"published","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1905.03835","open_access":"1"}],"abstract":[{"lang":"eng","text":"A graph game proceeds as follows: two players move a token through a graph to produce a finite or infinite path, which determines the payoff of the game. We study bidding games in which in each turn, an auction determines which player moves the token. Bidding games were largely studied in combination with two variants of first-price auctions called “Richman” and “poorman” bidding. We study taxman bidding, which span the spectrum between the two. The game is parameterized by a constant : portion τ of the winning bid is paid to the other player, and portion  to the bank. While finite-duration (reachability) taxman games have been studied before, we present, for the first time, results on infinite-duration taxman games: we unify, generalize, and simplify previous equivalences between bidding games and a class of stochastic games called random-turn games."}],"department":[{"_id":"ToHe"}],"day":"03","type":"journal_article","date_updated":"2023-08-07T14:08:34Z","month":"03","article_processing_charge":"No"}