Paper Info
Title
Online Budgeted Truthful Matching.
Abstract
An online truthful budgeted matching problem is considered for a bipartite graph, where the right vertices are available ahead of time, and individual left vertices arrive sequentially. On arrival of a left vertex, its edge utilities (or weights) to all the right vertices and a corresponding cost (or bid) are revealed. If a left vertex is matched to any of the right vertices, then it has to be paid at least as much as its cost. The problem is to match each left vertex instantaneously and irrevocably to any one of the right vertices, if at all, to find the maximum weight matching that is truthful, under a payment budget constraint. Truthfulness condition requires that no left vertex has any incentive of misreporting its cost. Assuming that the vertices arrive in an uniformly random order (secretary model) with arbitrary utilities, a truthful algorithm is proposed that is 24ß- competitive (where ß is the ratio of the maximum and the minimum utility) and satisfies the payment budget constraint. Direct applications of this problem include crowdsourcing auctions, and matching wireless users to cooperative relays in device-to-device enabled cellular network.
Year
DOI
Venue
2016
10.1145/3040230.3040232
ACM SIGMETRICS Performance Evaluation Review
DocType
Volume
Issue
Journal
44
3
ISSN
Citations 
PageRank 
0163-5999
0
0.34
References 
Authors
3
2
Name
Order
Citations
PageRank
Rahul Vaze146345.64
Marceau Coupechoux240248.44