基于效用Agent的隐私重铸规划问题DisCSPs
DisCSPs with Privacy Recast as Planning Problems for Utility-based Agents
摘要:
传统上,隐私一直是分散解决问题的主要动机。然而,即使已经提出了几个指标来量化它,没有一个容易与常见的求解器集成。约束编程是一种基本的范例,用于处理各种问题。我们引入了功利主义分布式约束满足问题(UDisCSP),其中每个状态的效用被估计为共享变量分配协议的预期回报和隐私损失的预期成本之间的差异。因此,传统的具有隐私要求的DisCSP被视为规划问题。代理可用的动作是:通信和本地推理。常见的分散式求解器在这里从他们的解释贪婪的规划者的角度进行评估。此外,我们研究了一些简单的扩展,这些求解器开始考虑效用函数。在这些扩展中,我们假设规划问题进一步限制通信动作的集合,仅限于相应的求解器协议中存在的通信原语。为新类型的问题获得的求解器提出了在每种情况下要执行的动作(通信/推理),从而定义了策略。
英文摘要:
Privacy has traditionally been a major motivation for decentralized problem solving. However, even though several metrics have been proposed to quantify it, none of them is easily integrated with common solvers. Constraint programming is a fundamental paradigm used to approach various families of problems. We introduce Utilitarian Distributed Constraint Satisfaction Problems (UDisCSP) where the utility of each state is estimated as the difference between the the expected rewards for agreements on assignments for shared variables, and the expected cost of privacy loss. Therefore, a traditional DisCSP with privacy requirements is viewed as a planning problem. The actions available to agents are: communication and local inference. Common decentralized solvers are evaluated here from the point of view of their interpretation as greedy planners. Further, we investigate some simple extensions where these solvers start taking into account the utility function. In these extensions we assume that the planning problem is further restricting the set of communication actions to only the communication primitives present in the corresponding solver protocols. The solvers obtained for the new type of problems propose the action (communication/inference) to be performed in each situation, defining thereby the policy.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。