Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2203.06647

QUAD: A Quality Aware Multi-Unit Double Auction Framework for IoT-Based Mobile Crowdsensing in Strategic Setting

Vikash Kumar Singh·Anjani Samhitha Jasti·Sunil Kumar Singh·Sanket Mishra
View original source ↗Read source document ↗Export metadata ↓

Abstract

Crowdsourcing with the intelligent agents carrying smart devices is becoming increasingly popular in recent years. It has opened up meeting an extensive list of real life applications such as measuring air pollution level, road traffic information, and so on. In literature this is known as mobile crowdsourcing or mobile crowdsensing. In this paper, the discussed set-up consists of multiple task requesters (or task providers) and multiple IoT devices (as task executors), where each of the task providers is having multiple homogeneous sensing tasks. Each of the task requesters report bid along with the number of homogeneous sensing tasks to the platform. On the other side, we have multiple IoT devices that reports the ask (charge for imparting its services) and the number of sensing tasks that it can execute. The valuations of task requesters and IoT devices are private information, and both might act strategically. One assumption that is made in this paper is that the bids and asks of the agents (task providers and IoT devices) follow decreasing marginal returns criteria. In this paper, a truthful mechanism is proposed for allocating the IoT devices to the sensing tasks carried by task requesters, that also keeps into account the quality of IoT devices. The mechanism is truthful, budget balance, individual rational, computationally efficient, and prior-free. The simulations are carried out to measure the performance of the proposed mechanism against the benchmark mechanisms. The code and the synthetic data are available at \textbf{https://github.com/Samhitha-Jasti/QUAD-Implementation}.

Explore related subjects

cs.GT

Keep this discovery

BibTeXRIS

Vikash Kumar Singh, Anjani Samhitha Jasti, Sunil Kumar Singh, Sanket Mishra. 2022-03-13. QUAD: A Quality Aware Multi-Unit Double Auction Framework for IoT-Based Mobile Crowdsensing in Strategic Setting. https://arxiv.org/abs/2203.06647

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

MMS Allocation for Chores with Online Agent Arrivals

We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to compute an allocation in which all items are assigned, and no agent incurs a cost more than $\alpha$ times her MMS. Without any prior information about the instance (other than $n$ and $m$), we design an algorithm with a competitive ratio of $O(\min\{n, k\log^{1+\epsilon}k, \log m\})$ for any constant $\epsilon > 0$, where $k$ denotes the number of cost function types. Our bound matches the best known offline approximation guarantees for MMS under subadditive costs and is nearly optimal with respect to all three parameters: we show that even for binary additive cost functions, no online algorithm can achieve a competitive ratio of $o(\min\{n, k\log k, \log m\})$. We then consider the setting in which the $k$ cost function types are known in advance (though the realized types of arriving agents are not). For additive cost functions, we provide an algorithm with a competitive ratio of $O(\min\{\log k, \log(kn)/\log\log(kn)\})$, and show that constant-competitive algorithms do not exist for general $k$, even for the binary additive setting. For binary additive functions when $k \le n$, we propose a $3$-competitive algorithm and establish a lower bound of $2$.

cs.GT↗
arXiv2026

Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees

We consider a game theoretic approach to solve multi-agent coordination problems with submodular maximization objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal, but that the equilibria which achieve this worst-case bound are not stable. To exploit this instability, we propose a family of algorithms which we call Truncated Noisy Best-Response (TNBR) Algorithms. These algorithms are flexibly characterized by agents asynchronously and stochastically selecting actions from a neighbourhood of their best response payoffs. We compute bounds on the recurrent classes of TNBR algorithms' associated Markov chains. Our bounds fall into two categories: first, "Performance" bounds ensure that TNBR algorithms always have a high-value recurrent state; second, "Safety" bounds ensure that TNBR algorithms never have arbitrarily-bad recurrent states. Furthermore, these two types of bounds are linked by a waterbed-like effect: every game with a poor Safety guarantee necessarily has a favorable Performance guarantee.

cs.GT↗
arXiv2026

Existence of the Core in Approval-Based Committee Elections

We settle the main open question in the theory of approval-based multi-winner elections: we show that there always exists a committee in the core. The core is a stability and group fairness concept. The proof introduces a new voting rule that optimizes an entropy-like objective function over committees and payment systems. All local optima of this objective function lie in the core, which implies that a core committee can be found in polynomial time.

cs.GT↗