209 citations · 595 across the 30 of their papers we have counts for
5 papers · 1 filter
Monte Carlo Techniques for Approximating the Myerson Value -- Theoretical and Empirical Analysis
Mateusz K. Tarkowski, Szymon Matejczyk, Tomasz P. Michalak +1
Myerson first introduced graph-restricted games in order to model the interaction of cooperative players with an underlying communication network. A dedicated solution concept -- t…
A Game-Theoretic Algorithm for Link Prediction
Mateusz Tarkowski, Tomasz Michalak, Michael Wooldridge
Predicting edges in networks is a key problem in social network analysis and involves reasoning about the relationships between nodes based on the structural properties of a networ…
Multi-agent Hierarchical Reinforcement Learning with Dynamic Termination
Dongge Han, Wendelin Boehmer, Michael Wooldridge +1
In a multi-agent system, an agent's optimal policy will typically depend on the policies chosen by others. Therefore, a key issue in multi-agent systems research is that of predict…
Manipulating a Learning Defender and Ways to Counteract
Jiarui Gan, Qingyu Guo, Long Tran-Thanh +2
In Stackelberg security games when information about the attacker's payoffs is uncertain, algorithms have been proposed to learn the optimal defender commitment by interacting with…
Imitative Follower Deception in Stackelberg Games
Jiarui Gan, Haifeng Xu, Qingyu Guo +3
Information uncertainty is one of the major challenges facing applications of game theory. In the context of Stackelberg games, various approaches have been proposed to deal with t…