Open AccessArticle

Contract-Based Incentive Mechanism for Mobile Crowdsourcing Networks

Nan Zhao

^1,*,

Menglin Fan

¹,

Chao Tian

² and

Pengfei Fan

Hubei Collaborative Innovation Center for High-efficiency Utilization of Solar Energy, Hubei University of Technology, Wuhan 430068, China

Hubei Key Laboratory for High-efficiency Utilization of Solar Energy and Operation Control of Energy Storage System, Hubei University of Technology, Wuhan 430068, China

Hubei Power Grid Intelligent Control and Equipment Engineering Technology Research Center, Hubei University of Technology, Wuhan 430068, China

Author to whom correspondence should be addressed.

Algorithms 2017, 10(3), 104; https://doi.org/10.3390/a10030104

Submission received: 26 July 2017 / Revised: 21 August 2017 / Accepted: 2 September 2017 / Published: 4 September 2017

Download

Browse Figures

Versions Notes

Abstract

Mobile crowdsourcing networks (MCNs) are a promising method of data collecting and processing by leveraging the mobile devices’ sensing and computing capabilities. However, because of the selfish characteristics of the service provider (SP) and mobile users (MUs), crowdsourcing participants only aim to maximize their own benefits. This paper investigates the incentive mechanism between the above two parties to create mutual benefits. By modeling MCNs as a labor market, a contract-based crowdsourcing model with moral hazard is proposed under the asymmetric information scenario. In order to incentivize the potential MUs to participate in crowdsourcing tasks, the optimization problem is formulated to maximize the SP’s utility by jointly examining the crowdsourcing participants’ risk preferences. The impact of crowdsourcing participants’ attitudes of risks on the incentive mechanism has been studied analytically and experimentally. Numerical simulation results demonstrate the effectiveness of the proposed contract design scheme for the crowdsourcing incentive.

Keywords:

mobile crowdsourcing; incentive mechanism; contract theory; risk preference

1. Introduction

According to the International Data Corporation, the worldwide smartphone market will reach 1.84 billion units in 2020. With the rapid development of IT technologies, mobile devices are always equipped with powerful processors, various sensors and large memories [1]. These devices can offer a novel paradigm to collect data about individuals, human society, and environments. Numerous mobile crowdsourcing applications have been created, such as OpenStreetMap [2] for constructing an openly licensed map of the world, CrowdDB [3] for querying and answering, Honeybee [4] for face detection, SignalGuru [5] for traffic signal detection, and Medusa [6] for environment sensing and data processing.

However, designing an efficient mobile crowdsourcing network (MCN) [7] is considerably challenging. First, while participating in tasks, mobile devices may consume their resources (i.e., battery, memory, and time) [1]. Mobile devices in MCNs are always controlled by rational users to maximize their own benefits. Moreover, the collected data usually contains location information with potential privacy and security threats. Mobile users (MUs) may not be willing to participate in crowdsourcing tasks without any extra incentives. Therefore, incentive mechanisms are necessary to achieve the win–win goal by considering the two parties’ requirements.

Recently, three primary incentive mechanisms have been suggested for MCNs, which are entertainment-based, service-based, and monetary-based mechanisms [8]. The entertainment-based incentive mechanism turns crowdsourcing tasks into playable games to attract crowdsourcing participants [9,10]. The service-based incentive mechanism attracts each crowdsourcing participant to make important contributions for crowdsourcing mutually [11,12,13]. The monetary-based incentive mechanism offers crowdsourcing participants rewards for their efforts [14,15,16]. Because the former two incentive mechanisms need to obtain the domain knowledge, the third incentive mechanism is more suitable for general crowdsourcing scenarios. Yang et al. [14] proposed two incentive mechanisms to attract MUs to participate in crowdsourcing tasks. Zhang et al. [15] designed three online incentive mechanisms for mobile crowdsourcing sensing. Zhao et al. [16] proposed the online incentive mechanism for crowdsourcing tasks with a budget constraint. However, most existing works have assumed that crowdsourcing participants will not deviate from the incentive mechanism.

Unfortunately, because of users’ mobility and mobile wireless environments’ dynamicity, certain crowdsourcing information (i.e., crowdsourcing efforts of MUs) may not be available to the service provider (SP), which causes network information asymmetry between the MUs and the SP. The SP may not monitor the MUs’ crowdsourcing action in real-time, and the MUs may deviate from the incentive mechanism. To tackle this problem, we propose a contract-based incentive mechanism. Contract theory [17] investigates how economic parties make decisions under uncertain conditions or make contracts with asymmetric information. Recently, it has been successfully applied to many practical problems, for example, cooperative spectrum trading [18], mobile crowdsourcing [19], and cooperative relay [20,21,22]. Duan and Lin et al. considered the cooperative incentive with resource-exchange spectrum trading [18]. Ho et al. investigated the adaptive contract design for crowdsourcing markets [19]. Zhang et al. proposed the incentive mechanism approach to solve the optimal compensation package with moral hazard [23]. Our prior works developed an efficient contract model for adverse selection in the presence of the wireless nodes’ hidden relay information [20] and moral hazard problems [21] caused by the wireless nodes’ hidden relay actions. However, none of these considered the risk attitudes of crowdsourcing participants (i.e., an SP, or mobile devices). Most existing works have assumed that the MUs are risk-neutral. Practically, some MUs may want to “gamble” too much by crowdsourcing sensing, and the crowdsourcing participants’ behavioral features will be influenced by their attitudes on risk.

Inspired by these existing works, this work investigates the crowdsourcing incentive mechanism in the presence of asymmetric information with risk attitudes. A contract-based incentive model is proposed to obtain the effort-incentive objective. The bonus ratio related to the MUs’ performance is introduced to motivate the MUs to work effectively. The optimal contract designs are investigated by jointly examining both the SP’s and MUs’ risk preferences. A moral hazard model is proposed to incentivize the MUs to participate in crowdsourcing tasks effectively with asymmetric information. The optimization incentive problem is formulated to maximize the SP’s expected utility subject to the feasible conditions of the MUs. The impact of the crowdsourcing participants’ risk preferences on the incentive mechanism has been studied analytically and experimentally. Simulations have demonstrated the proposed incentive mechanism’s performance.

The rest of the paper is organized as follows. Section 2 introduces the system model for the crowdsourcing incentive mechanism. The optimal contract design with risk attitudes is proposed and discussed in Section 3 and Section 4, respectively. Section 5 demonstrates the performance evaluation results, and Section 6 concludes this work.

2. System Model for Crowdsourcing Incentive Mechanism

As shown in Figure 1, a MCN includes three basic entities: an SP, end users, and N MUs. End users first send their requests to the SP for help. Then, the SP divides the service requests into several small crowdsourcing tasks, which are published on the service platform. The MUs are recruited for crowdsourcing tasks by the SP. Once these crowdsourcing tasks are finished, the SP provides the end users with the final service.

However, because of the selfish characteristics of the SP and MUs, crowdsourcing participants only aim to maximize their own benefits. This paper investigates the incentive mechanism between the above two parties to create mutual benefits. Mobile crowdsourcing is modeled as a labor market. The SP, as the employer, offers the contract to recruit certain MUs for crowdsourcing. The contract is composed of a set of different items regarding the various combinations of the basic wage and performance bonus. Each MU, as an employee, chooses one item from the contract when participating in crowdsourcing tasks.

Moreover, in this context, to characterize the behaviour of crowdsourcing participants regarding their willingness to participate in crowdsourcing tasks, the participants’ behaviour can be categorized as risk-averse or risk-neutral [24]. A risk-averse MU does not want to obtain too great a profit by participating in crowdsourcing tasks. A risk-averse SP appreciates higher profit but demands a basic level of service, whereas a risk-neutral participant is an entity whose objective is only to maximize the SP’s profit.

2.1. Utility of Mobile Users

Suppose that the ith MU offers its crowdsourcing effort

e_{i}

to obtain the reward from the SP. The SP can achieve profit

π_{i}

with the help of the ith MU. As a result of some measurement errors, the SP’s achieved profit may be slightly different from the actual effort exerted by the MU. Therefore, we assume that the SP’s actual achieved profit

π_{i}

is a noisy signal, which is given as

π_{i} = θ_{i} e_{i} + δ

(1)

where

θ_{i}

is the profit per unit crowdsourcing effort, and

δ

is a normally distributed random variable with

δ \sim N (0, σ^{2})

The more the crowdsourcing resources the MUs consume, the greater the crowdsourcing cost the MUs pay. Moreover, we assume that

C_{i} (e_{i})

grows more rapidly in the large crowdsourcing effort than it does in the small crowdsourcing effort. Therefore,

{C_{i}}^{'} (e_{i}) > 0

and

{C_{i}}^{''} (e_{i}) > 0

. For simplicity, the crowdsourcing cost

C_{i} (e_{i})

of the ith MU is assumed to be quadratic:

C_{i} (e_{i}) = c_{i} e_{i}^{2} / 2

(2)

where

c_{i}

is the ith MU’s crowdsourcing cost coefficient, which can describe the ith MU’s crowdsourcing cost information (i.e., battery, memory, and computing power). We note that different crowdsourcing scenarios may have a different crowdsourcing cost.

We assume that the SP offers the payment

W_{M_{i}}

to the ith MU in the linear form [25] defined as

W_{M_{i}} = α_{i} + β_{i} π_{i} - \frac{c_{i}}{2} e_{i}^{2}

(3)

where

α_{i}

is the ith MU’s basic wage, and

β_{i} \in [0, 1]

is the bonus coefficient related to the crowdsourcing performance. Considering the different crowdsourcing actions, MUs may obtain different bonuses.

The payment

W_{M_{i}}

is approximately normally distributed with means

E [W_{M_{i}}] = α_{i} + β_{i} θ_{i} e_{i} - \frac{c_{i}}{2} e_{i}^{2}

(4)

and variances

V_{a r} [W_{M_{i}}] = β_{i}^{2} σ^{2}

(5)

In this section, we assume that each MU has a constant absolute risk-averse (CARA) preference; then, the ith MU’s negative exponential utility is defined as

u (W_{M_{i}}) = - e^{- η_{M} W_{M_{i}}}

(6)

where

η_{M} > 0

is the ith MU’s coefficient of absolute risk aversion (

η_{M} = - u^{''} (W_{M_{i}}) / u^{'} (W_{M_{i}})

). A larger value of

η_{M} > 0

means that the MU has less incentive to participate in crowdsourcing tasks;

η_{M} = 0

means that the MU is risk-neutral. A risk-neutral MU’s decision is not affected by the degree of crowdsourcing uncertainty.

Then, the ith MU’s expected utility

u (W_{M_{i}})

can be written as

\begin{matrix} E [u (W_{M_{i}})] & = E [- e^{- η_{M} W_{M_{i}}}] \\ = \frac{- 1}{\sqrt{2 π V_{a r} [W_{M_{i}}]}} \int_{- \infty}^{\infty} e^{- \frac{W_{M_{i}}^{2} - 2 E [W_{M_{i}}] W_{M_{i}} + {(E [W_{M_{i}}])}^{2} + 2 V_{a r} [W_{M_{i}}] η_{M} W_{M_{i}}}{2 V_{a r} [W_{M_{i}}]}} d W_{M_{i}} \\ = \frac{- 1}{\sqrt{2 π V_{a r} [W_{M_{i}}]}} \cdot e^{\frac{1}{2} V_{a r} [W_{M_{i}}] η_{M}^{2} - E [W_{M_{i}}] η_{M}} \cdot \int_{- \infty}^{\infty} e^{- \frac{{(W_{M_{i}} - E [W_{M_{i}}] + V_{a r} [W_{M_{i}}] η_{M})}^{2}}{2 V_{a r} [W_{M_{i}}]}} d W_{M_{i}} \\ = - e^{- η_{M} [E [W_{M_{i}}] - \frac{1}{2} V_{a r} [W_{M_{i}}] η_{M}]}, \\ - e^{- η_{M} [α_{i} + β_{i} θ_{i} e_{i} - \frac{c_{i}}{2} e_{i}^{2} - \frac{η_{M}}{2} β_{i}^{2} σ^{2}]} \end{matrix}

(7)

2.2. Utility of Service Provider

Considering the MUs’ crowdsourcing effort

e_{i}

and the SP’s reward allocation

W_{M_{i}}

, the SP’s total utility can be written as

W_{S} = \sum_{i = 1}^{N} [(1 - β_{i}) π_{i} - α_{i}]

(8)

with means

E [W_{S}] = \sum_{i = 1}^{N} [(1 - β_{i}) θ_{i} e_{i} - α_{i}]

(9)

and variances

\begin{matrix} V_{a r} [W_{S}] & = \sum_{i = 1}^{N} {(1 - β_{i})}^{2} σ^{2} \end{matrix}

(10)

Then, similarly to the MUs, the SP’s CARA risk preferences are also considered. Thus, the SP’s expected utility is represented as

E [u (W_{S})] = E [- e^{- η_{S} W_{S}}] = - e^{- η_{S} [E [W_{S}] - \frac{1}{2} V_{a r} [W_{S}] η_{S}]}

(11)

where

η_{S}

represents the SP’s absolute risk-averse degree. The larger

η_{S}

is, the more the SP is afraid of risk. When

η_{S} = 0

, the SP is risk-neutral.

2.3. Problem Formulation

Considering the MUs’ selfishness and the limited resources, the MUs may intend to shirk or act less carefully in crowdsourcing tasks. For example, because crowdsourcing tasks consume the MUs’ resources (i.e., battery, memory, and time), the MUs may like to obtain their benefits from the SP to maximize their own utilities with little crowdsourcing effort. Thus, the MUs may not take the full responsibilities for their tasks. Because of the asymmetry of network information, the MUs’ crowdsourcing actions are unobservable to the SP, which leads to the moral hazard problem. This moral hazard problem influences the crowdsourcing’s performance. Therefore, the SP needs to design a contract-based incentive mechanism to motivate the MUs to participate in crowdsourcing tasks efficiently and credibly.

As shown in Figure 2, when the SP designs the optimal contract, the SP broadcasts a set of contract items to the potential MUs. Then, after receiving the contract, the MUs willing to accept certain contract items inform the SP of their choices. Next, after receiving the MUs’ confirmations, the SP informs the employed MUs’ crowdsourcing tasks, and the MUs help to participate in crowdsourcing sensing or computing. Finally, after receiving the data from the MUs, the SP checks for the required information. If the MUs succeed in the crowdsourcing tasks, the SP rewards the MUs according to their contracts. However, if the information fails to meet the requirement, the employed MUs obtain no reward. Because this requires limited interaction with potential MUs, this contract-based incentive mechanism is simple to implement, and can effectively reduce communication and computation overhead.

3. Contract-Based Crowdsourcing Incentive Mechanism

As a result of information asymmetry, the SP may not obtain the MUs’ exact crowdsourcing efforts after contracting between the SP and the MUs. Therefore, the designed contract should ensure that each MU selects the optimal effort

e_{i}^{*}

to maximize its own utility. Then, the following incentive compatibility (IC) constraint should be satisfied:

(I C) max_{e_{i} \geq 0} E [u (W_{M_{i}})]

(12)

We let

f_{M_{i}} = α_{i} + β_{i} θ_{i} e_{i} - \frac{c_{i}}{2} e_{i}^{2} - \frac{η_{M}}{2} β_{i}^{2} σ^{2}

; then, the ith MU’s expected utility

u (W_{M_{i}})

in Equation (7) can be rewritten as

E [u (W_{M_{i}})] = - e^{- η_{M} f_{M_{i}}}

(13)

Because

\frac{\partial E [u (W_{M_{i}})]}{\partial f_{M_{i}}} = η_{M} e^{- η_{M} f_{M_{i}}} > 0

, the IC constraint in Equation (12) can be simplified as

(I C) max_{e_{i} \geq 0} f_{M_{i}} = α_{i} + β_{i} θ_{i} e_{i} - \frac{c_{i}}{2} e_{i}^{2} - \frac{η_{M}}{2} β_{i}^{2} σ^{2}

(14)

Then, in order to ensure that the utility each MU has received is no lower than its retained utility

\bar{U}

, the following individually rational (IR) constraint should be satisfied:

(I R) α_{i} + β_{i} θ_{i} e_{i} - \frac{c_{i}}{2} e_{i}^{2} - \frac{η_{M}}{2} β_{i}^{2} σ^{2} \geq \bar{U}, 1 \leq i \leq N

(15)

Thus, on the basis of the above IC and IR constraints, the optimal contract is designed to achieve the maximum expected utility of the SP, which can be written as

\begin{matrix} max_{{{α_{i}, β_{i}} \geq 0}} E [u (W_{S})], \\ s . t . (I C) max_{e_{i} \geq 0} α_{i} + β_{i} θ_{i} e_{i} - \frac{c_{i}}{2} e_{i}^{2} - \frac{η_{M}}{2} β_{i}^{2} σ^{2}, \\ (I R) α_{i} + β_{i} θ_{i} e_{i} - \frac{c_{i}}{2} e_{i}^{2} - \frac{η_{M}}{2} β_{i}^{2} σ^{2} \geq \bar{U}, 1 \leq i \leq N . \end{matrix}

(16)

Similarly to the case of MUs, we let

f_{S} = E [W_{S}] - \frac{V_{a r} [W_{S}]}{2} η_{S} = \sum_{i = 1}^{N} [(1 - β_{i}) θ_{i} e_{i} - α_{i} - \frac{η_{S}}{2} σ^{2} {(1 - β_{i})}^{2}]

(17)

Then, we simplify the SP’s expected utility in Equation (11) to

E [u (W_{S})] = - e^{- η_{S} f_{S}}

(18)

Because

\frac{\partial E [u (W_{S})]}{\partial f_{S}} = η_{S} e^{- η_{S} f_{S}} > 0

, we simplify the SP’s optimization problem to

\begin{matrix} max_{{{α_{i}, β_{i}} \geq 0}} f_{S} = \sum_{i = 1}^{N} [(1 - β_{i}) θ_{i} e_{i} - α_{i} - \frac{η_{S}}{2} σ^{2} {(1 - β_{i})}^{2}], \\ s . t . (I C) max_{e_{i} \geq 0} α_{i} + β_{i} θ_{i} e_{i} - \frac{c_{i}}{2} e_{i}^{2} - \frac{η_{M}}{2} β_{i}^{2} σ^{2}, \\ (I R) α_{i} + β_{i} θ_{i} e_{i} - \frac{c_{i}}{2} e_{i}^{2} - \frac{η_{M}}{2} β_{i}^{2} σ^{2} \geq \bar{U}, 1 \leq i \leq N . \end{matrix}

(19)

From the first IC constraint, we have

e_{i}^{*} = \frac{β_{i} θ_{i}}{c_{i}}

. Then, the optimal effort

e_{i}^{*} (β_{i})

can be obtained from the above formula.

Because the SP’s expected utility in Equation (16) is decreasing in

α_{i}

, the SP can obtain its maximum utility by decreasing

α_{i}

until

α_{i} + β_{i} θ_{i} e_{i} - \frac{c_{i}}{2} e_{i}^{2} - \frac{η_{M}}{2} β_{i}^{2} σ^{2} = \bar{U}

Accordingly, we can further simplify the SP’s utility maximization problem in Equation (19) to

max_{{{β_{i}} \geq 0}} \sum_{i = 1}^{N} [\frac{θ_{i}^{2} β_{i}}{c_{i}} - \bar{U} - \frac{β_{i}^{2} θ_{i}^{2}}{2 c_{i}} - \frac{η_{M}}{2} β_{i}^{2} σ^{2} - \frac{η_{S}}{2} σ^{2} {(β_{i} - 1)}^{2}]

(20)

We note that the SP’s optimization problem with

2 N

variables (

α_{i}, β_{i}

) in Equation (19) is simplified to the variables

β_{i}

in Equation (20). Any local optimal solution (denoted as

{\hat{β}}_{i}

) to the problem of Equation (19) satisfies

{\frac{d f_{s}}{d β_{i}}|}_{β_{i} = {\hat{β}}_{i}} = \frac{θ_{i}^{2}}{c_{i}} - \frac{θ_{i}^{2}}{c_{i}} {\hat{β}}_{i} - η_{M} σ^{2} {\hat{β}}_{i} - η_{S} σ^{2} ({\hat{β}}_{i} - 1) = 0

(21)

Then, the second-order derivative of the problem of Equation (19) is

{\frac{d^{2} f_{s}}{d {β_{i}}^{2}}|}_{β_{i} = {\hat{β}}_{i}} = - \frac{θ_{i}^{2}}{c_{i}} - η_{M} σ^{2} - η_{S} σ^{2} < 0

(22)

Thus, the optimal solution to Equation (19) is achieved as

β_{i}^{*} = \frac{θ_{i}^{2} + η_{S} σ^{2} c_{i}}{θ_{i}^{2} + η_{M} σ^{2} c_{i} + η_{S} σ^{2} c_{i}}

(23)

Therefore, Table 1 summarizes the optimal contract settings and the two parties’ optimal expected utilities.

4. Analysis and Discussion

In this section, the impact of the crowdsourcing participants’ risk preferences on the incentive mechanism is illustrated.

First, the optimal incentive mechanism of the risk-averse MUs is considered with

η_{M} \neq 0

. From Equation (23), we have

\frac{\partial β_{i}^{*}}{\partial η_{M}} = \frac{- σ^{2} c_{i} (θ_{i}^{2} + η_{S} σ^{2} c_{i})}{{(θ_{i}^{2} + η_{M} σ^{2} c_{i} + η_{S} σ^{2} c_{i})}^{2}} < 0

(24)

\frac{\partial β_{i}^{*}}{\partial η_{S}} = \frac{η_{M} σ^{4} c_{i}^{2}}{{(θ_{i}^{2} + η_{M} σ^{2} c_{i} + η_{S} σ^{2} c_{i})}^{2}} > 0

(25)

and

\frac{\partial β_{i}^{*}}{\partial c_{i}} = \frac{- η_{M} σ^{2} θ_{i}^{2}}{{(θ_{i}^{2} + η_{M} σ^{2} c_{i} + η_{S} σ^{2} c_{i})}^{2}} < 0

(26)

Thus, from the above formulas, we have that the ith MU’s optimal bonus coefficient

β_{i}^{*}

is decreasing in its absolute risk-averse coefficient

η_{M}

and in its crowdsourcing cost, andis increasing in the SP’s absolute risk-averse coefficient

η_{S}

. Given the SP’s absolute risk-averse coefficient

η_{S}

, an increasing

η_{M}

can reduce the MU’s optimal bonus coefficient. The greater the SP’s absolute risk-averse coefficient

η_{S}

, the greater the risk transferred to the MUs, and the greater the MU’s optimal bonus coefficient

β_{i}^{*}

. Therefore, the MUs need to take a greater risk to obtain more utility.

Then, because

e_{i}^{*} = \frac{β_{i}^{*} θ_{i}}{c_{i}}

, from the above illustrations, we can also have that the ith MU’s optimal effort

e_{i}^{*}

is decreasing in its absolute risk-averse coefficient

η_{M}

and increasing in the SP’s absolute risk-averse coefficient

η_{S}

. The greater the MU’s absolute risk-averse coefficient

η_{M}

, the lesser the value its crowdsourcing risk will take, and the lower the expected level of its effort.

In particular, the optimal incentive mechanism of the risk-neutral MUs is considered with

η_{M} = 0

. From Equation (23), we have

β_{i}^{*} = 1

e_{i}^{*} = \frac{θ_{i}}{c_{i}}

and

f_{S}^{*} = \sum_{i = 1}^{N} [\frac{θ_{i}^{2}}{2 c_{i}} - \bar{U}]

. We notice that the optimal expected utility of the SP has no relation to the MUs’ crowdsourcing effort. Furthermore, the greater the MU’s crowdsourcing cost, the lower the level of its effort.

5. Numerical Results

Numerical simulation results are presented to assess the proposed mechanism.

Figure 3 demonstrates the MUs’ optimal basic wage

α_{i}^{*}

, bonus coefficient

β_{i}^{*}

and crowdsourcing effort

e_{i}^{*}

with the same crowdsourcing cost

c_{i}

. We notice that as

θ_{i}

becomes large, the ith MU’s profit per unit crowdsourcing effort increases; thus the optimal crowdsourcing effort

e_{i}^{*}

increases and the SP may allocate a greater bonus

β_{i}^{*}

to attract the MUs to offer enough crowdsourcing effort. Then, because

β_{i}^{*}

increases, the SP only needs to offer a lesser basic wage

α_{i}^{*}

to the MUs for enough help.

Figure 4 shows the performance of the crowdsourcing effort-incentive with three MUs. The simulation parameter setting is the same as for Figure 3. Each MU obtains its maximum utility by selecting the optimal crowdsourcing effort

e_{i}^{*}

. Thus, in the proposed optimal contract, the SP can attract the MUs to take full responsibility for their crowdsourcing tasks. The proposed contract-based incentive mechanism breaks information asymmetry and attracts the MUs to make maximum crowdsourcing efforts.

Figure 5 presents the MUs’ optimal basic wage

α_{i}^{*}

, bonus coefficient

β_{i}^{*}

and crowdsourcing effort

e_{i}^{*}

with the same crowdsourcing profit

θ_{i}

. As shown in Figure 4, the MUs’ optimal bonus coefficient

β_{i}^{*}

and the crowdsourcing effort

e_{i}^{*}

increase in the crowdsourcing cost coefficient

c_{i}

. The MUs’ optimal basic wage

α_{i}^{*}

increases in the crowdsourcing cost coefficient

c_{i}

. As

c_{i}

becomes large, the

i^{t h}

MU’s crowdsourcing cost increases; thus the SP may offer a greater basic wage

α_{i}^{*}

to obtain enough crowdsourcing effort.

Figure 6 shows the MUs’ optimal bonus coefficient

β_{i}^{*}

with the various SP’s risk-averse degree

η_{S}

and MUs’ risk-averse degree

η_{M}

;

θ_{i}

is the same as that in Figure 3. We notice that the ith MU’s optimal bonus coefficient

β_{i}^{*}

decreases in its absolute risk-averse coefficient

η_{M}

and increases in the SP’s absolute risk-averse coefficient

η_{S}

. Similar results can be obtained for cases of the MUs’ optimal effort

e_{i}^{*}

, which verifies Equations (24) and (26). Figure 7 illustrates the SP’s optimal expected utility with the SP’s variable risk-averse degree

η_{S}

and MUs’ risk-averse degree

η_{M}

. As the SP’s variable risk averse degree

η_{S}

and the MUs’ risk-averse degree

η_{M}

become large, the SP’s optimal expected utility decreases. The greater the MUs’ risk-averse degree

η_{M}

, the lesser the SP’s optimal expected utility. Thus, in order to obtain more utilities, the SP needs to choose MUs with a lesser risk-averse degree.

Finally, by introducing another two mechanisms, we evaluate the proposed incentive mechanism. The first incentive mechanism is the contract-based mechanism in the presence of symmetric information (i.e., the SP obtains information about the MUs’ crowdsourcing efforts). The second incentive mechanism is a linear pricing scheme with

α_{i} = 0

. In this linear pricing mechanism, the SP only specifies the performance-based bonus coefficient

β_{i}

, without the basic wage.

Figure 8 presents the SP’s optimal expected utility with the different incentive mechanisms. In these three incentive mechanisms, the contract-based mechanism under the symmetric information scenario obtains the maximum expected utility of the SP, which is considered to be the upper bound on the SP’s expected utility. Compared to the other two incentive mechanisms, the SP with the proposed contract scheme always achieves more utility than that with

α_{i} = 0

. Moreover, as

η_{S}

increases, the SP becomes much more afraid of risk, and thus the SP obtains less utility.

6. Conclusions

In this paper, we investigate a novel contract-based crowdsourcing incentive mechanism between the SP and the MUs. Because of the selfish characteristics of the SP and the MUs, the incentive mechanism is proposed economically to achieve the win–win goal by considering the two parties’ requirements. Moreover, considering both the SP’s and MUs’ risk preferences, the optimal contract design is investigated under an asymmetric information scenario. A moral-hazard contract model is discussed to attract the MUs to take full responsibility for their tasks. The impact of the crowdsourcing participants’ risk preferences on the incentive mechanism has been studied analytically and experimentally. Simulation results show that the proposed contract-based incentive mechanism can effectively improve the performance of crowdsourcing.

Acknowledgments

This work was supported by the National Natural Science Foundation of China (61501178). The author would like to acknowledge the anonymous reviewers whose constructive criticism, comments, and suggestions led to a greatly improved manuscript.

Author Contributions

Nan Zhao conceived and designed this research as well writing this paper, Menglin Fan prepared the part of the paper related to mobile crowdsourcing networks, Chao Tian and Pengfei Fan performed all experiments and performed the discussion of results.

Conflicts of Interest

The authors declare no conflict of interest.

References

Yang, K.; Zhang, K.; Ren, J.; Shen, X. Security and privacy in mobile crowdsourcing networks: Challenges and opportunities. IEEE Commun. Mag. 2015, 53, 75–81. [Google Scholar] [CrossRef]
Ren, J.; Zhang, Y.; Zhang, K.; Shen, X. Exploiting mobile crowdsourcing for pervasive cloud services: Challenges and solutions. IEEE Commun. Mag. 2015, 53, 98–105. [Google Scholar] [CrossRef]
Franklin, M.; Kossmann, D.; Kraska, T.; Ramesh, S.; Xin, R. Crowddb: Answering queries with crowdsourcing. In Proceedings of the ACM SIGMOD, Athens, Greece, 12–16 June 2011; pp. 61–72. [Google Scholar]
Fernando, N.; Loke, S.; Rahayu, W.; Wenny, W. Honeybee: A programming framework for mobile crowd computing. In Proceedings of the International Conference on Mobile and Ubiquitous Systems: Computing, Networking, and Services, Tokyo, Japan, 2–4 December 2013; pp. 224–236. [Google Scholar]
Koukoumidis, E.; Peh, S.; Martonosi, M. Signalguru: Leveraging mobile phones for collaborative traffic signal schedule advisory. In Proceedings of the ACM MobiSys, Bethesda, MD, USA, 28 June–1 July 2011; pp. 127–140. [Google Scholar]
Ra, M.; Liu, B.; Porta, T.; Govindan, R. Medusa: A programming framework for crowd-sensing applications. In Proceedings of the ACM MobiSys, Ambleside, UK, 25–29 June 2012; pp. 337–350. [Google Scholar]
Chen, P.; Cheng, S.; Ting, P.; Lien, C.; Chu, F. When crowdsourcing meets mobile sensing: A social network perspective. IEEE Commun. Mag. 2015, 53, 157–163. [Google Scholar] [CrossRef]
Zhang, X.; Zheng, Z.; Sun, W.; Liu, Y.; Tang, S.; Xing, K.; Mao, X. Incentives for mobile crowd sensing: A survey. IEEE Commun. Surv. Tutor. 2016, 18, 54–67. [Google Scholar] [CrossRef]
Magerkurth, C.; Cheok, A.; Mandryk, R.; Nilsen, T. Pervasive games: Bringing computer entertainment back to the real world. ACM Comput. Entertain. 2005, 3, 4. [Google Scholar] [CrossRef]
Avouris, N.; Yiannoutsou, N. A review of mobile location-based games for learning across physical and virtual spaces. J. Univ. Comput. Sci. 2012, 18, 2120–2142. [Google Scholar]
Luo, T.; Tham, C. Fairness and social welfare in incentivizing participatory sensing. In Proceedings of the IEEE SECON, Seoul, Korea, 18–21 June 2012; pp. 425–433. [Google Scholar]
Lan, K.; Chou, C.; Wang, H. An incentive-based framework for vehicle-based mobile sensing. Procedia Comput. Sci. 2012, 10, 1152–1157. [Google Scholar] [CrossRef]
Chen, P.; Ao, W.; Lin, S.; Chen, K. Reciprocal spectrum sharing game and mechanism in cellular systems with cognitive radio users. In Proceedings of the IEEE GLOBECOM Workshops, Houston, TX, USA, 5–9 December 2011; pp. 981–985. [Google Scholar]
Yang, D.; Xue, G.; Fang, X.; Tang, J. Crowdsourcing to smartphones: Incentive mechanism design for mobile phone sensing. In Proceedings of the ACM Mobicom, Istanbul, Turkey, 22–26 August 2012; pp. 173–184. [Google Scholar]
Zhang, X.; Yang, Z.; Zhou, Z.; Cai, H.; Chen, L.; Li, X. Free market of crowdsourcing: Incentive mechanism design for mobile sensing. IEEE Trans. Parallel Distrib. Syst. 2014, 25, 3190–3200. [Google Scholar] [CrossRef]
Zhao, D.; Li, X.; Ma, H. Budget-feasible online incentive mechanisms for crowdsourcing tasks truthfully. IEEE ACM Trans. Netw. 2016, 24, 647–661. [Google Scholar] [CrossRef]
Aghion, P.; Bolton, P. An incomplete contracts approach to financial contracting. Rev. Econ. Stud. 1992, 59, 473–494. [Google Scholar] [CrossRef]
Duan, L.; Gao, L.; Huang, J. Cooperative spectrum sharing: A contract-based approach. IEEE Trans. Mob. Comput. 2014, 13, 174–187. [Google Scholar] [CrossRef]
Ho, C.; Slivkins, A.; Vaughan, J. Adaptive contract design for crowdsourcing markets: Bandit algorithms for repeated principal-agent problems. J. Artif. Intell. Res. 2016, 55, 317–359. [Google Scholar]
Zhao, N.; Wu, M.; Xiong, W.; Liu, C. Cooperative communication in cognitive radio networks under asymmetric information: A contract-theory based approach. Int. J. Distrib. Sens. Netw. 2015, 2015, 1–11. [Google Scholar] [CrossRef]
Zhao, N.; Wu, M.; Xiong, W.; Liu, C. Optimal contract design for cooperative relay incentive mechanism under moral hazard. J. Electr. Comput. Eng. 2015, 2015, 1–7. [Google Scholar] [CrossRef]
Zhao, N.; Chen, Y.; Liu, R.; Wu, M.; Xiong, W. Monitoring strategy for relay incentive mechanism in cooperative communications networks. Comput. Electr. Eng. 2017, 60, 14–29. [Google Scholar] [CrossRef]
Zhang, Y.; Gu, Y.; Liu, L.; Pan, M.; Dawy, Z.; Han, Z. Incentive mechanism in crowdsourcing with moral hazard. In Proceedings of the IEEE Wireless Communications and Networking Conference, New Orleans, LA, USA, 9–12 March 2015; pp. 2085–2090. [Google Scholar]
Chavas, J. Risk analysis in theory and practice. Risk Anal. Theor. Pract. 2004, 2004, 231–235. [Google Scholar]
Gibbons, R. Incentives between firms (and within). Manag. Sci. 2005, 51, 2–17. [Google Scholar] [CrossRef]

Figure 1. Mobile crowdsourcing network (MCN).

Figure 2. Contract-based incentive mechanism for mobile crowdsourcing.

Figure 3. Mobile users’ (MUs’) optimal contract design with various

θ_{i}

for fixed

η_{M} = 0.3

η_{S} = 0.3

σ^{2} = 1

c_{i} = 0.4

, and

\bar{U} = 0.2

Figure 3. Mobile users’ (MUs’) optimal contract design with various

θ_{i}

for fixed

η_{M} = 0.3

η_{S} = 0.3

σ^{2} = 1

c_{i} = 0.4

, and

\bar{U} = 0.2

Figure 4. Mobile users’ (MUs’) optimal utility with different types of effort-incentive design.

Figure 5. Mobile users’ (MUs’) optimal contract design with the crowdsourcing cost coefficient

c_{i}

for fixed

η_{M} = 0.3

η_{S} = 0.3

σ^{2} = 1

θ_{i} = 0.2

, and

\bar{U} = 0

Figure 5. Mobile users’ (MUs’) optimal contract design with the crowdsourcing cost coefficient

c_{i}

for fixed

η_{M} = 0.3

η_{S} = 0.3

σ^{2} = 1

θ_{i} = 0.2

, and

\bar{U} = 0

Figure 6. Mobile users’ (MUs’) optimal bonus coefficient

β^{*}

for fixed

σ^{2} = 1

and

\bar{U} = 0

Figure 6. Mobile users’ (MUs’) optimal bonus coefficient

β^{*}

for fixed

σ^{2} = 1

and

\bar{U} = 0

Figure 7. Service provider’s (SP’s) optimal expected utility for fixed

σ^{2} = 0.5

and

\bar{U} = 0

Figure 7. Service provider’s (SP’s) optimal expected utility for fixed

σ^{2} = 0.5

and

\bar{U} = 0

Figure 8. Comparison between the service provider’s (SP’s) optimal expected utility with the various incentive mechanisms for fixed

η_{M} = 0.3

σ^{2} = 0.5

c_{i} = 0.1

, and

\bar{U} = 0

Figure 8. Comparison between the service provider’s (SP’s) optimal expected utility with the various incentive mechanisms for fixed

η_{M} = 0.3

σ^{2} = 0.5

c_{i} = 0.1

, and

\bar{U} = 0

Table 1. Optimal contract design parameters and settings.

Parameters	Settings
$β_{i}^{*}$	$\frac{θ_{i}^{2} + η_{S} σ^{2} c_{i}}{θ_{i}^{2} + η_{M} σ^{2} c_{i} + η_{S} σ^{2} c_{i}}$
$e_{i}^{*}$	$\frac{β_{i}^{*} θ_{i}}{c_{i}}$
$α_{i}^{*}$	$\bar{U} - β_{i}^{} θ_{i} e_{i}^{} + \frac{c_{i}}{2} {(e_{i}^{})}^{2} + \frac{η_{M}}{2} {(β_{i}^{})}^{2} σ^{2}$
${E [u (W_{M_{i}})]}^{*}$	$- e^{- η_{M} \bar{U}}$
$f_{S}^{*}$	$\sum_{i = 1}^{N} [(1 - β_{i}^{}) θ_{i} e_{i}^{} - α_{i}^{} - \frac{η_{S}}{2} σ^{2} {(1 - β_{i}^{})}^{2}]$
${E [W_{S}]}^{*}$	$- e^{- η_{S} f_{S}^{*}}$

© 2017 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).

Share and Cite

MDPI and ACS Style

Zhao, N.; Fan, M.; Tian, C.; Fan, P. Contract-Based Incentive Mechanism for Mobile Crowdsourcing Networks. Algorithms 2017, 10, 104. https://doi.org/10.3390/a10030104

AMA Style

Zhao N, Fan M, Tian C, Fan P. Contract-Based Incentive Mechanism for Mobile Crowdsourcing Networks. Algorithms. 2017; 10(3):104. https://doi.org/10.3390/a10030104

Chicago/Turabian Style

Zhao, Nan, Menglin Fan, Chao Tian, and Pengfei Fan. 2017. "Contract-Based Incentive Mechanism for Mobile Crowdsourcing Networks" Algorithms 10, no. 3: 104. https://doi.org/10.3390/a10030104

APA Style

Zhao, N., Fan, M., Tian, C., & Fan, P. (2017). Contract-Based Incentive Mechanism for Mobile Crowdsourcing Networks. Algorithms, 10(3), 104. https://doi.org/10.3390/a10030104

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Menu

Contract-Based Incentive Mechanism for Mobile Crowdsourcing Networks

Abstract

1. Introduction

2. System Model for Crowdsourcing Incentive Mechanism

2.1. Utility of Mobile Users

2.2. Utility of Service Provider

2.3. Problem Formulation

3. Contract-Based Crowdsourcing Incentive Mechanism

4. Analysis and Discussion

5. Numerical Results

6. Conclusions

Acknowledgments

Author Contributions

Conflicts of Interest

References

Share and Cite

Article Metrics

Article Access Statistics

Further Information

Guidelines

MDPI Initiatives

Follow MDPI