← Search

Branislav Bošanský

4 accepted papers

2021

Computing Quantal Stackelberg Equilibrium in Extensive-Form Games

AAAI 2021technical

Deployments of game-theoretic solution concepts in the real world have highlighted the necessity to consider human opponents' boundedly rational behavior. If subrationality is not addressed, the system can face significant losses in terms of expected utility. While there exist algorithms for computi…

Cited by 9SourcePDFScholar
2021

Solving Partially Observable Stochastic Shortest-Path Games

IJCAI 2021poster

We study the two-player zero-sum extension of the partially observable stochastic shortest-path problem where one agent has only partial information about the environment. We formulate this problem as a partially observable stochastic game (POSG): given a set of target states and negative rewards f…

Cited by 5SourcePDFScholar
2020

Automated Construction of Bounded-Loss Imperfect-Recall Abstractions in Extensive-Form Games (Extended Abstract)

IJCAI 2020poster

Information abstraction is one of the methods for tackling large extensive-form games (EFGs). Removing some information available to players reduces the memory required for computing and storing strategies. We present novel domain-independent abstraction methods for creating very coarse abstractions…

Cited by 0SourcePDFScholar
2020

Dinkelbach-Type Algorithm for Computing Quantal Stackelberg Equilibrium

IJCAI 2020poster

Stackelberg security games (SSGs) have been deployed in many real-world situations to optimally allocate scarce resource to protect targets against attackers. However, actual human attackers are not perfectly rational and there are several behavior models that attempt to predict subrational behavior…

Cited by 0SourcePDFScholar