activity
20122023
most citedKnapsack based Optimal Policies for Budget-Limited Multi-Armed Bandits

100 citations · 229 across the 26 of their papers we have counts for

collaborators
Showing 2019Show all

9 papers · 1 filter

cs.GT2019

Path Planning Problems with Side Observations-When Colonels Play Hide-and-Seek

Dong Quan Vu, Patrick Loiseau, Alonso Silva +1

Resource allocation games such as the famous Colonel Blotto (CB) and Hide-and-Seek (HS) games are often used to model a large variety of practical problems, but only in their one-s…

cs.GT2019

Defending with Shared Resources on a Network

Minming Li, Long Tran-Thanh, Xiaowei Wu

In this paper we consider a defending problem on a network. In the model, the defender holds a total defending resource of R, which can be distributed to the nodes of the network.…

cs.LG2019★ 1 cited

Streaming Bayesian Inference for Crowdsourced Classification

Edoardo Manino, Long Tran-Thanh, Nicholas R. Jennings

A key challenge in crowdsourcing is inferring the ground truth from noisy and unreliable data. To do so, existing approaches rely on collecting redundant information from the crowd…

cs.MA2019

AED: An Anytime Evolutionary DCOP Algorithm

Saaduddin Mahmud, Moumita Choudhury, Md. Mosaddek Khan +2

Evolutionary optimization is a generic population-based metaheuristic that can be adapted to solve a wide variety of optimization problems and has proven very effective for combina…

cs.GT2019

Social Cost Guarantees in Smart Route Guidance

Paolo Serafino, Carmine Ventre, Long Tran-Thanh +3

We model and study the problem of assigning traffic in an urban road network infrastructure. In our model, each driver submits their intended destination and is assigned a route to…

cs.GT2019★ 10 cited

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…

cs.GT2019

Path Planning Problems with Side Observations-When Colonels Play Hide-and-Seek

Dong Quan Vu, Patrick Loiseau, Alonso Silva +1

Resource allocation games such as the famous Colonel Blotto (CB) and Hide-and-Seek (HS) games are often used to model a large variety of practical problems, but only in their one-s…

cs.CR2019★ 7 cited

Selfish Mining in Proof-of-Work Blockchain with Multiple Miners: An Empirical Evaluation

Tin Leelavimolsilp, Long Tran-Thanh, Sebastian Stein +1

Proof-of-Work blockchain, despite its numerous benefits, is still not an entirely secure technology due to the existence of Selfish Mining (SM) strategies that can disrupt the syst…

cs.GT2019

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…