02/02/2021

Efficient Querying for Cooperative Probabilistic Commitments

Qi Zhang, Edmund H. Durfee, Satinder Singh

Keywords:

Abstract Paper Similar Papers

Abstract: Multiagent systems can use commitments as the core of a general coordination infrastructure, supporting both cooperative and non-cooperative interactions. Agents whose objectives are aligned, and where one agent can help another achieve greater reward by sacrificing some of its own reward, should choose a cooperative commitment to maximize their joint reward. We present a solution to the problem of how cooperative agents can efficiently find an (approximately) optimal commitment by querying about carefully-selected commitment choices. We prove structural properties of the agents' values as functions of the parameters of the commitment specification, and develop a greedy method for composing a query with provable approximation bounds, which we empirically show can find nearly optimal commitments in a fraction of the time methods that lack our insights require.

The video of this talk cannot be embedded. You can watch it here:
https://slideslive.com/38948691
(Link will open in new window)
 0
 0
 0
 0
  Share    
This is an embedded video. Talk and the respective paper are published at AAAI 2021 virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment
no comments yet
code of conduct: tbd Characters remaining: 140

Similar Papers

 0
 0
 0
 0
 4:10 
 0
 0
 0
 0
 14:15 
 0
 0
 0
 0
 14:26 
 0
 0
 0
 0
 14:28 
 0
 0
 0
 0
 3:22 
 0
 0
 0
 0
 14:18 
 0
 0
 0
 0
 15:04 
 0
 0
 0
 0
 16:54 
 0
 0
 0
 0
 14:45 
 0
 0
 0
 0
 6:42 
 0
 0
 0
 0
 13:24 
 0
 0
 0
 0
 15:07 
 0
 0
 0
 0
 15:05 
 0
 0
 0
 0
 14:29 
 0
 0
 0
 0
 5:15 
 0
 0
 0
 0
 3:20 
 0
 0
 0
 0
 3:11 
 0
 0
 0
 0
 3:22 
 0
 0
 0
 0
 3:07 
 0
 0
 0
 0
 14:22 
 0
 0
 0
 0
 12:57 
 0
 0
 0
 0
 16:28 
 0
 0
 0
 0
 9:06 
 0
 0
 0
 0
 12:05 
 0
 0
 0
 0
 14:28 
 0
 0
 0
 0
 18:11 
 0
 0
 0
 0
 19:52 
 0
 0
 0
 0
 14:13 
 0
 0
 0
 0
 17:04 
 0
 0
 0
 0
 13:51 
 0
 0
 0
 0
 5:14 
 0
 0
 0
 0
 11:20 
 0
 0
 0
 0
 12:06 
 0
 0
 0
 0
 17:23 
 0
 0
 0
 0
 5:16 
 0
 0
 0
 0
 10:12 
 0
 0
 0
 0
 19:48 
 0
 0
 0
 0
 11:47 
 0
 0
 0
 0
 18:21 
 0
 0
 0
 0
 13:10