对抗性任务分配
Adversarial Task Allocation
摘要:
向工人分配任务的问题具有长期的根本重要性。这方面的例子包括在分布式计算环境中将计算任务分配给节点的经典问题,以及最近的众包问题,其中大量任务被安排由人类工作者完成。对这一问题的广泛研究通常涉及不确定性和众包中的激励等重要问题。然而,对抗性篡改任务分配过程的问题并没有得到足够的关注。我们关注的是任务分配中的一个特定的对抗性设置,攻击者可能会针对特定的工人,以防止分配给这个工人的任务被完成。我们考虑两种攻击模型:一种是对手只观察分配策略(可能是随机的),另一种是攻击者观察实际的分配决策。对于所有任务都是同质的情况下,我们提供多项式时间算法的两个设置。当任务是异构的,但是,我们显示的对抗分配问题是NP-难的,并提出了解决它的算法时,防守者被限制为每个任务只分配一个工人。令人惊讶的是,我们的实验表明,这两种攻击模型之间的差异是最小的:确定性分配可以实现几乎一样多的效用随机。
英文摘要:
The problem of allocating tasks to workers is of long standing fundamental importance. Examples of this include the classical problem of assigning computing tasks to nodes in a distributed computing environment, as well as the more recent problem of crowdsourcing where a broad array of tasks are slated to be completed by human workers. Extensive research into this problem generally addresses important issues such as uncertainty and, in crowdsourcing, incentives. However, the problem of adversarial tampering with the task allocation process has not received as much attention. We are concerned with a particular adversarial setting in task allocation where an attacker may target a specific worker in order to prevent the tasks assigned to this worker from being completed. We consider two attack models: one in which the adversary observes only the allocation policy (which may be randomized), and the second in which the attacker observes the actual allocation decision. For the case when all tasks are homogeneous, we provide polynomial-time algorithms for both settings. When tasks are heterogeneous, however, we show the adversarial allocation problem to be NP-Hard, and present algorithms for solving it when the defender is restricted to assign only a single worker per task. Our experiments show, surprisingly, that the difference between the two attack models is minimal: deterministic allocation can achieve nearly as much utility as randomized.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。