A perspective on incentive design: Challenges and opportunities

LJ Ratliff, R Dong, S Sekar, T Fiez - Annual Review of Control …, 2019 - annualreviews.org
The increasingly tight coupling between humans and system operations in domains ranging
from intelligent infrastructure to e-commerce has led to a challenging new class of problems …

Influence-and interest-based worker recruitment in crowdsourcing using online social networks

A Alagha, S Singh, H Otrok… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
Workers recruitment remains a significant issue in Mobile Crowdsourcing (MCS), where the
aim is to recruit a group of workers that maximizes the expected Quality of Service (QoS) …

Hyper-heuristics based on reinforcement learning, balanced heuristic selection and group decision acceptance

VA de Santiago Junior, E Özcan, VR de Carvalho - Applied Soft Computing, 2020 - Elsevier
In this paper, we introduce a multi-objective selection hyper-heuristic approach combining
Reinforcement Learning,(meta) heuristic selection, and group decision-making as …

Budgeted combinatorial multi-armed bandits

D Das, S Jain, S Gujar - arXiv preprint arXiv:2202.03704, 2022 - arxiv.org
We consider a budgeted combinatorial multi-armed bandit setting where, in every round, the
algorithm selects a super-arm consisting of one or more arms. The goal is to minimize the …

A multiarmed bandit based incentive mechanism for a subset selection of customers for demand response in smart grids

J Shweta, G Sujit - Proceedings of the AAAI Conference on Artificial …, 2020 - aaai.org
Demand response is a crucial tool to maintain the stability of the smart grids. With the
upcoming research trends in the area of electricity markets, it has become a possibility to …

[HTML][HTML] A quality assuring, cost optimal multi-armed bandit mechanism for expertsourcing

S Jain, S Gujar, S Bhat, O Zoeter, Y Narahari - Artificial Intelligence, 2018 - Elsevier
There are numerous situations when a service requester wishes to expertsource a series of
identical but non-trivial tasks from a pool of experts so as to achieve an assured accuracy …

The diverse cohort selection problem

C Schumann, SN Counts, JS Foster… - arXiv preprint arXiv …, 2017 - arxiv.org
How should a firm allocate its limited interviewing resources to select the optimal cohort of
new employees from a large set of job applicants? How should that firm allocate cheap but …

Differentially private federated combinatorial bandits with constraints

S Solanki, S Kanaparthy, S Damle, S Gujar - Joint European Conference …, 2022 - Springer
There is a rapid increase in the cooperative learning paradigm in online learning settings, ie,
federated learning (FL). Unlike most FL settings, there are many situations where the agents …

A budget feasible peer graded mechanism for iot-based crowdsourcing

VK Singh, S Mukhopadhyay, F Xhafa… - Journal of Ambient …, 2020 - Springer
We develop and extend a line of recent works on the design of mechanisms for
heterogeneous tasks assignment problem in'crowdsourcing'. The budgeted market we …

Combinatorial bandits under strategic manipulations

J Dong, K Li, S Li, B Wang - … Conference on Web Search and Data …, 2022 - dl.acm.org
Strategic behavior against sequential learning methods, such as" click framing''in real
recommendation systems, have been widely observed. Motivated by such behavior we …