社会协调的复杂性
The Complexity of Social Coordination
摘要:
协调是一项具有挑战性的日常任务;想想你上次组织一个聚会或一个涉及几个人的会议。随着我们的社交和职业生活越来越多地上网,一个改进协调过程的机会出现了。最近,Gupta等人提出了纠缠查询作为数据驱动协调的声明性抽象,其中协调任务的难度从用户转移到数据库。不幸的是,评估纠缠查询是非常困难的,因此以前的工作只考虑了一类有限的查询,满足安全性(协调伙伴是固定的)和唯一性(所有查询都需要得到满足)。在本文中,我们显着扩展类的可行纠缠查询超越唯一性和安全性。首先,我们表明,我们可以简单地下降的唯一性,仍然有效地评估一组安全的纠缠查询。第二,我们表明,只要所有用户的协调在同一组属性,我们可以给出一个有效的算法协调,即使该集的查询不满足安全性。在实验评估中,我们表明,我们的算法是可行的,广泛的协调方案。
英文摘要:
Coordination is a challenging everyday task; just think of the last time you organized a party or a meeting involving several people. As a growing part of our social and professional life goes online, an opportunity for an improved coordination process arises. Recently, Gupta et al. proposed entangled queries as a declarative abstraction for data-driven coordination, where the difficulty of the coordination task is shifted from the user to the database. Unfortunately, evaluating entangled queries is very hard, and thus previous work considered only a restricted class of queries that satisfy safety (the coordination partners are fixed) and uniqueness (all queries need to be satisfied). In this paper we significantly extend the class of feasible entangled queries beyond uniqueness and safety. First, we show that we can simply drop uniqueness and still efficiently evaluate a set of safe entangled queries. Second, we show that as long as all users coordinate on the same set of attributes, we can give an efficient algorithm for coordination even if the set of queries does not satisfy safety. In an experimental evaluation we show that our algorithms are feasible for a wide spectrum of coordination scenarios.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。