Bidding graph games with partially-observable budgets
Two-player zero-sum graph games are a central model, which proceeds as follows. A token is placed on a vertex of a graph, and the two players move it to produce an infinite play, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In bid...
محفوظ في:
| المؤلفون الرئيسيون: | , , |
|---|---|
| التنسيق: | text |
| اللغة: | English |
| منشور في: |
Institutional Knowledge at Singapore Management University
2023
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://ink.library.smu.edu.sg/sis_research/9080 https://ink.library.smu.edu.sg/context/sis_research/article/10083/viewcontent/25679_Article_Text_29742_1_2_20230626.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| المؤسسة: | Singapore Management University |
| اللغة: | English |