4 citations · 9 across the 4 of their papers we have counts for
9 papers
Admissible Policy Teaching through Reward Design
Kiarash Banihashem, Adish Singla, Jiarui Gan +1
We study reward design strategies for incentivizing a reinforcement learning agent to adopt a policy from a set of admissible policies. The goal of the reward designer is to modify…
Approximately Envy-Free Budget-Feasible Allocation
Jiarui Gan, Bo Li, Xiaowei Wu
In the budget-feasible allocation problem, a set of items with varied sizes and values are to be allocated to a group of agents. Each agent has a budget constraint on the total siz…
Budget-feasible Maximum Nash Social Welfare Allocation is Almost Envy-free
Xiaowei Wu, Bo Li, Jiarui Gan
The Nash social welfare (NSW) is a well-known social welfare measurement that balances individual utilities and the overall efficiency. In the context of fair allocation of indivis…
Swap Stability in Schelling Games on Graphs
Aishwarya Agarwal, Edith Elkind, Jiarui Gan +1
We study a recently introduced class of strategic games that is motivated by and generalizes Schelling's well-known residential segregation model. These games are played on undirec…
Protecting Elections by Recounting Ballots
Edith Elkind, Jiarui Gan, Svetlana Obraztsova +2
Complexity of voting manipulation is a prominent topic in computational social choice. In this work, we consider a two-stage voting manipulation scenario. First, a malicious party…
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…