Preference-aware task assignment in on-demand taxi dispatching: An online stable matching approach

A central issue in on-demand taxi dispatching platforms is task assignment, which designs matching policies among dynamically arrived drivers (workers) and passengers (tasks). Previous matching policies maximize the profit of the platform without considering the preferences of workers and tasks (e.g., workers may prefer high-rewarding tasks while tasks may prefer nearby workers). Such ignorance of preferences impairs user experience and will decrease the profit of the platform in the long run. To address this problem, we propose preference-aware task assignment using online stable matching. Specifically, we define a new model, Online Stable Matching under Known Identical Independent Distributions (OSM-KIID). It not only maximizes the expected total profits (OBJ-1), but also tries to satisfy the preferences among workers and tasks by minimizing the expected total number of blocking pairs (OBJ-2). The model also features a practical arrival assumption validated on real-world dataset. Furthermore, we present a linear program based online algorithm LP-ALG, which achieves an online ratio of at least 1−1/e on OBJ-1 and has at most 0.6·|E| blocking pairs expectedly, where |E| is the total number of edges in the compatible graph. We also show that a natural Greedy can have an arbitrarily bad performance on OBJ-1 while maintaining around 0.5·|E| blocking pairs. Evaluations on both synthetic and real datasets confirm our theoretical analysis and demonstrate that LP-ALG strictly dominates all the baselines on both objectives when tasks notably outnumber workers

Crowdsourcing

Chapter 2 in the book Cultural-historical perspectives on collective intelligence. In the era of digital communication, collective problem solving is increasingly important. Large groups can now resolve issues together in completely different ways, which has transformed the arts, sciences, business, education, technology, and medicine. Collective intelligence is something we share with animals and is different from machine learning and artificial intelligence. To design and utilize human collective intelligence, we must understand how its problem-solving mechanisms work. From democracy in ancient Athens, through the invention of the printing press, to COVID-19, this book analyzes how humans developed the ability to find solutions together. This wide-ranging, thought-provoking book is a game-changer for those working strategically with collective problem solving within organizations and using a variety of innovative methods. It sheds light on how humans work effectively alongside machines to confront challenges that are more urgent than what humanity has faced before. This title is also available as Open Access on Cambridge Core.Chapter 2 describes crowdsourcing, a process where problems are sent outside an organization to a large group of people—a crowd—who can help provide solutions. Online citizen science and online innovation contests are of particular interest because of their societal value. Within innovation, the two selected examples are from IdeaConnection and Climate Co-lab, two innovation intermediaries who host different types of online innovation contests. One of these contests, the IdeaRalley, represents an interesting new crowdsourcing method that allows hundreds of experts to participate in a one-week long intensive idea building process. In online citizen science, Zooniverse (e.g. Galaxy Zoo) and Foldit, are selected as two prominent, but contrasting examples. The online protein folding game Foldit stands out as a particularly successful project that show what amateur gamers can achieve. The game design combines human visual skills with computer power in solving protein-structure prediction problems by constructing three-dimensional structures. Most successful solutions are team performances or achievements made by the entire Foldit gaming community. All the examples in this chapter illustrate successful case stories, and the detailed analysis identify basic problem-solving mechanisms in crowdsourcing.publishedVersio

Collaborative Route Planning of UAVs, Workers and Cars for Crowdsensing in Disaster Response

Efficiently obtaining the up-to-date information in the disaster-stricken area is the key to successful disaster response. Unmanned aerial vehicles (UAVs), workers and cars can collaborate to accomplish sensing tasks, such as data collection, in disaster-stricken areas. In this paper, we explicitly address the route planning for a group of agents, including UAVs, workers, and cars, with the goal of maximizing the task completion rate. We propose MANF-RL-RP, a heterogeneous multi-agent route planning algorithm that incorporates several efficient designs, including global-local dual information processing and a tailored model structure for heterogeneous multi-agent systems. Global-local dual information processing encompasses the extraction and dissemination of spatial features from global information, as well as the partitioning and filtering of local information from individual agents. Regarding the construction of the model structure for heterogeneous multi-agent, we perform the following work. We design the same data structure to represent the states of different agents, prove the Markovian property of the decision-making process of agents to simplify the model structure, and also design a reasonable reward function to train the model. Finally, we conducted detailed experiments based on the rich simulation data. In comparison to the baseline algorithms, namely Greedy-SC-RP and MANF-DNN-RP, MANF-RL-RP has exhibited a significant improvement in terms of task completion rate