activity
20192023
most citedIncentivize Diffusion with Fair Rewards

8 citations · 15 across the 6 of their papers we have counts for

collaborators

7 papers

cs.GT2023

Incentive-Compatible Selection for One or Two Influentials

Yuxin Zhao, Yao Zhang, Dengji Zhao

Selecting influentials in networks against strategic manipulations has attracted many researchers' attention and it also has many practical applications. Here, we aim to select one…

cs.GT2022

Task Allocation on Networks with Execution Uncertainty

Xiuzhen Zhang, Yao Zhang, Dengji Zhao

We study a single task allocation problem where each worker connects to some other workers to form a network and the task requester only connects to some of the workers. The goal i…

cs.GT2021

Incentive Compatible Mechanism for Influential Agent Selection

Xiuzhen Zhang, Yao Zhang, Dengji Zhao

Selecting the most influential agent in a network has huge practical value in applications. However, in many scenarios, the graph structure can only be known from agents' reports o…

cs.GT20203 cited

Sybil-proof Answer Querying Mechanism

Yao Zhang, Xiuzhen Zhang, Dengji Zhao

We study a question answering problem on a social network, where a requester is seeking an answer from the agents on the network. The goal is to design reward mechanisms to incenti…

cs.GT20194 cited

Maximal Information Propagation with Budgets

Haomin Shi, Yao Zhang, Zilin Si +2

In this paper, we present an information propagation game on a network where the information is originated from a sponsor who is willing to pay a fixed total budget to the players…

cs.GT20198 cited

Incentivize Diffusion with Fair Rewards

Wen Zhang, Dengji Zhao, Yao Zhang

This paper studies a sale promotion mechanism design problem on a social network, where a node (a seller) sells one item to the other nodes on the network to maximize her revenue.…