Reachability Poorman discrete-bidding games

• المؤلفون الرئيسيون: AVNI, Guy, MEGGENDORFER, Tobias, SADHUKHAN, Suman, TKADLEC, Josef, ZIKELIC, Dorde
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2023
• الموضوعات: Artificial Intelligence and Robotics
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/sis_research/9083; https://ink.library.smu.edu.sg/context/sis_research/article/10086/viewcontent/FAIA_372_FAIA230264.pdf

We consider bidding games, a class of two-player zerosum graph games. The game proceeds as follows. Both players have bounded budgets. A token is placed on a vertex of a graph, in each turn the players simultaneously submit bids, and the higher bidder moves the token, where we break bidding ties in...