8 citations · 25 across the 15 of their papers we have counts for
15 papers · 1 filter
Fair Incentives for Early Arrival in 0-1 Cooperative Games
Yaoxin Ge, Yao Zhang, Dengji Zhao
Incentives for early arrival (I4EA) was recently proposed for studying online cooperative games. In an online cooperative game, players arrive in an unknown order, and the value in…
Coalitions on the Fly in Cooperative Games
Yao Zhang, Indrajit Saha, Zhaohong Sun +1
In this work, we examine a sequential setting of a cooperative game in which players arrive dynamically to form coalitions and complete tasks either together or individually, depen…
Incentives for Early Arrival in Cost Sharing
Junyu Zhang, Yao Zhang, Yaoxin Ge +4
In cooperative games, we study how values created or costs incurred by a coalition are shared among the members within it, and the players may join the coalition in a online manner…
Fair Diffusion Auctions
Zixin Gu, Yaoxin Ge, Yao Zhang +1
Diffusion auction design is a new trend in mechanism design which extends the original incentive compatibility property to include buyers' private connection report. Reporting conn…
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…
Distributed Mechanism Design in Social Networks
Haoxin Liu, Yao Zhang, Dengji Zhao
Designing auctions to incentivize buyers to invite new buyers via their social connections is a new trend in mechanism design. The challenge is that buyers are competitors and we n…
A Redistribution Framework for Diffusion Auctions
Sizhe Gu, Yao Zhang, Yida Zhao +1
Redistribution mechanism design aims to redistribute the revenue collected by a truthful auction back to its participants without affecting the truthfulness. We study redistributio…
Optimal Diffusion Auctions
Yao Zhang, Shanshan Zheng, Dengji Zhao
Diffusion auction design is a new trend in mechanism design for which the main goal is to incentivize existing buyers to invite new buyers, who are their neighbors on a social netw…
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…
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…
Incentives to Invite Others to Form Larger Coalitions
Yao Zhang, Dengji Zhao
We study a cooperative game setting where the grand coalition may change since the initial players can invite more players. We focus on monotone games, i.e., adding more players to…
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…
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…
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.…
Collaborative Data Acquisition
Wen Zhang, Yao Zhang, Dengji Zhao
We consider a requester who acquires a set of data (e.g. images) that is not owned by one party. In order to collect as many data as possible, crowdsourcing mechanisms have been wi…