Author image not provided
 Branislav Bošanský

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article2.28
Citation Count57
Publication count25
Publication years2008-2017
Available for download12
Average downloads per article78.08
Downloads (cumulative)937
Downloads (12 Months)153
Downloads (6 Weeks)34
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


25 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 25
Result page: 1 2

Sort by:

1 published by ACM
December 2017 ACM Transactions on Economics and Computation (TEAC) - Special Issue on Wine'15: Volume 5 Issue 4, December 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 20,   Downloads (12 Months): 20,   Downloads (Overall): 20

Full text available: PDFPDF
The Stackelberg equilibrium is a solution concept that describes optimal strategies to commit to: Player 1 ( the leader ) first commits to a strategy that is publicly announced, then Player 2 ( the follower ) plays a best response to the leader’s choice. We study the problem of computing ...
Keywords: Algorithmic game theory, Extensive-Form Correlated Equilibrium, extensive-form games, finite sequential games, stackelberg equilibrium

2
May 2017 AAMAS '17: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems
Publisher: International Foundation for Autonomous Agents and Multiagent Systems
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 2,   Downloads (12 Months): 19,   Downloads (Overall): 19

Full text available: PDFPDF
Extensive-form games with imperfect recall are an important model of dynamic games where the players are allowed to forget previously known information. Often, imperfect recall games are the result of an abstraction algorithm that simplifies a large game with perfect recall. Unfortunately, solving an imperfect recall game has fundamental problems ...
Keywords: game theory, imperfect recall, maxmin strategies

3
November 2016 GameSec 2016: 7th International Conference on Decision and Game Theory for Security - Volume 9996
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Pursuit-evasion games model many security problems where an evader is trying to escape a group of pursuing units. We consider a variant with partial observability and simultaneous moves of all units, and assume the worst-case setup, where the evader knows the location of pursuer's units, but the pursuer does not ...

4
February 2016 AAAI'16: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

Strong Stackelberg Equilibrium (SSE) is a fundamental solution concept in game theory in which one player commits to a strategy, while the other player observes this commitment and plays a best response. We present a new algorithm for computing SSE for two-player extensive-form general-sum games with imperfect information (EFGs) where ...

5
December 2015 WINE 2015: Proceedings of the 11th International Conference on Web and Internet Economics - Volume 9470
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 1

The Stackelberg equilibrium is a solution concept that describes optimal strategies to commit to: Player�1 the leader first commits to a strategy that is publicly announced, then Player�2 the follower plays a best response to the leader's choice. We study Stackelberg equilibria in finite sequential i.e., extensive-form games and provide ...

6
May 2015 AAMAS '15: Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems
Publisher: International Foundation for Autonomous Agents and Multiagent Systems
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 9,   Downloads (Overall): 39

Full text available: PDFPDF
Game theory describes the conditions for the strategies of rational agents to form an equilibrium. However, game theory can fail from the prescriptive viewpoint and can serve only as a heuristic recommendation for agents. There exists a plethora of game theoretic solution concepts, however, their effectiveness has never been compared; ...
Keywords: game theory, general-sum games, solution concepts

7
January 2015 AAAI'15: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 2

Stackelberg equilibrium is a solution concept prescribing for a player an optimal strategy to commit to, assuming the opponent knows this commitment and plays the best response. Although this solution concept is a cornerstone of many security applications, the existing works typically do not consider situations where the players can ...

8
January 2015 AAAI'15: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 2

Many search and security games played on a graph can be modeled as normal-form zero-sum games with strategies consisting of sequences of actions. The size of the strategy space provides a computational challenge when solving these games. This complexity is tackled either by using the compact representation of sequential strategies ...

9
September 2014 Journal of Artificial Intelligence Research: Volume 51 Issue 1, September 2014
Publisher: AI Access Foundation
Bibliometrics:
Citation Count: 4

Developing scalable solution algorithms is one of the central problems in computational game theory. We present an iterative algorithm for computing an exact Nash equilibrium for two-player zero-sum extensive-form games with imperfect information. Our approach combines two key elements: (1) the compact sequence-form representation of extensive- form games and (2) ...

10
August 2014 ECAI'14: Proceedings of the Twenty-first European Conference on Artificial Intelligence
Publisher: IOS Press
Bibliometrics:
Citation Count: 0

Nash equilibrium (NE) is the best known solution concept used in game theory. It is known that NE is particularly weak even in zero-sum extensive-form games since it can prescribe irrational actions to play that do not exploit mistakes made by an imperfect opponent. These issues are addressed by a ...

11
May 2014 AAMAS '14: Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems
Publisher: International Foundation for Autonomous Agents and Multiagent Systems
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1,   Downloads (12 Months): 11,   Downloads (Overall): 59

Full text available: PDFPDF
Patrolling games are partially observable games played by two players, the defender and the attacker. The defender aims for detecting intrusions into vulnerable targets by following randomized routes among them, the attacker strives to maximize the probability of a successful (undetected) intrusion. We show how to translate patrolling games into ...
Keywords: stochastic games, patrolling games, game theory

12
December 2013 NIPS'13: Proceedings of the 26th International Conference on Neural Information Processing Systems - Volume 2
Publisher: Curran Associates Inc.
Bibliometrics:
Citation Count: 0

We study Monte Carlo tree search (MCTS) in zero-sum extensive-form games with perfect information and simultaneous moves. We present a general template of MCTS algorithms for these games, which can be instantiated by various selection methods. We formally prove that if a selection method is ε-Hannan consistent in a matrix ...

13
August 2013 IJCAI '13: Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 3

We focus on solving two-player zero-sum extensive-form games with perfect information and simultaneous moves. In these games, both players fully observe the current state of the game where they simultaneously make a move determining the next state of the game. We solve these games by a novel algorithm that relies ...

14
May 2013 AAMAS '13: Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Publisher: International Foundation for Autonomous Agents and Multiagent Systems
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 6,   Downloads (Overall): 43

Full text available: PDFPDF
We investigate iterative algorithms for computing exact Nash equilibria in two-player zero-sum extensive-form games. The algorithms use an algorithmic framework of double-oracle methods. The main idea is to restrict the game by allowing the players to play only some of the strategies, and then iteratively solve this restricted game and ...
Keywords: algorithms, extensive-form games, game theory, iterative approaches

15
August 2012 ECAI'12: Proceedings of the 20th European Conference on Artificial Intelligence
Publisher: IOS Press
Bibliometrics:
Citation Count: 0

We argue that the problem of adversarial plan recognition, where the observed agent actively tries to avoid detection, should be modeled in the game theoretic framework. We define the problem as an imperfect-information extensive-form game between the observer and the observed agent. We propose a novel algorithm that approximates the ...

16
August 2012 ECAI'12: Proceedings of the 20th European Conference on Artificial Intelligence
Publisher: IOS Press
Bibliometrics:
Citation Count: 0

We develop and evaluate a new exact algorithm for finding Nash equilibria of two-player zero-sum extensive-form games with imperfect information. Our approach is based on the sequence-form representation of the game, and uses an algorithmic framework of double-oracle methods that have been used successfully in other classes of games. The ...

17
June 2012 AAMAS '12: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Publisher: International Foundation for Autonomous Agents and Multiagent Systems
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 4,   Downloads (12 Months): 14,   Downloads (Overall): 82

Full text available: PDFPDF
With scaling of multi-robot teams deployed in military operations, there is a need to boost autonomy of individual, as well as team behaviors. We developed a feature-rich simulation testbed for experimental evaluation of multi-agent coordination mechanisms applicable in tactical military operations in urban warfare. In particular, we investigated and implemented ...
Keywords: planing and plan repair, simulation toolkits, multi-agent coordination and teamwork, tactical operations, game theory

18
June 2012 AAMAS '12: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Publisher: International Foundation for Autonomous Agents and Multiagent Systems
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 0,   Downloads (12 Months): 13,   Downloads (Overall): 105

Full text available: PDFPDF
We investigate algorithms for playing multi-agent visibility-based pursuit-evasion games. A team of pursuers attempts to maintain visibility contact with an evader who actively avoids tracking. We aim for applicability of the algorithms in real-world scenarios; hence, we impose hard constraints on the run-time of the algorithms and we evaluate them ...
Keywords: pursuit-evasion game, anytime algorithm, informationset search, Monte-Carlo tree search

19
June 2012 AAMAS '12: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Publisher: International Foundation for Autonomous Agents and Multiagent Systems
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 4,   Downloads (12 Months): 23,   Downloads (Overall): 194

Full text available: PDFPDF
We study the problem of optimal resource allocation for packet selection and inspection to detect potential threats in large computer networks with multiple computers of differing importance. An attacker tries to harm these targets by sending malicious packets from multiple entry points of the network; the defender thus needs to ...
Keywords: computer networks, submodularity, approximation algorithm, game-theory, security

20
August 2011 HoloMAS'11: Proceedings of the 5th international conference on Industrial applications of holonic and multi-agent systems for manufacturing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

We investigate the problem of cooperation of self-interested agents with respect to the confidentiality of their plans and without a presence of any third-party mediator. We base our approach on non-zerosum n-player games in the extensive form focusing on two main goals: (1) the analysis of the maximal improvement of ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us