TY - GEN
T1 - Fairness and social welfare in incentivizing participatory sensing
AU - Luo, Tie
AU - Tham, Chen Khong
PY - 2012
Y1 - 2012
N2 - Participatory sensing has emerged recently as a promising approach to large-scale data collection. However, without incentives for users to regularly contribute good quality data, this method is unlikely to be viable in the long run. In this paper, we link incentive to users' demand for consuming compelling services, as an approach complementary to conventional credit or reputation based approaches. With this demand-based principle, we design two incentive schemes, Incentive with Demand Fairness (IDF) and Iterative Tank Filling (ITF), for maximizing fairness and social welfare, respectively. Our study shows that the IDF scheme is max-min fair and can score close to 1 on the Jain's fairness index, while the ITF scheme maximizes social welfare and achieves a unique Nash equilibrium which is also Pareto and globally optimal. We adopted a game theoretic approach to derive the optimal service demands. Furthermore, to address practical considerations, we use a stochastic programming technique to handle uncertainty that is often encountered in real life situations.
AB - Participatory sensing has emerged recently as a promising approach to large-scale data collection. However, without incentives for users to regularly contribute good quality data, this method is unlikely to be viable in the long run. In this paper, we link incentive to users' demand for consuming compelling services, as an approach complementary to conventional credit or reputation based approaches. With this demand-based principle, we design two incentive schemes, Incentive with Demand Fairness (IDF) and Iterative Tank Filling (ITF), for maximizing fairness and social welfare, respectively. Our study shows that the IDF scheme is max-min fair and can score close to 1 on the Jain's fairness index, while the ITF scheme maximizes social welfare and achieves a unique Nash equilibrium which is also Pareto and globally optimal. We adopted a game theoretic approach to derive the optimal service demands. Furthermore, to address practical considerations, we use a stochastic programming technique to handle uncertainty that is often encountered in real life situations.
UR - http://www.scopus.com/inward/record.url?scp=84867970455&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84867970455&partnerID=8YFLogxK
U2 - 10.1109/SECON.2012.6275807
DO - 10.1109/SECON.2012.6275807
M3 - Conference contribution
AN - SCOPUS:84867970455
SN - 9781467319058
T3 - Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks workshops
SP - 425
EP - 433
BT - 2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2012
T2 - 2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2012
Y2 - 18 June 2012 through 21 June 2012
ER -