2020
DOI: 10.48550/arxiv.2012.07195
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Efficient Querying for Cooperative Probabilistic Commitments

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 32 publications
0
2
0
Order By: Relevance
“…As before, the Greedy query closely tracks optimal. We give more details in the full version (Zhang, Durfee, and Singh 2020b), along with a comparison between our approach and multiagent planning techniques previously studied in Overcooked, where we saw that, even with small queries (k = 2), our decentralized query-based probabilistic commitment approach got within 99.5% of the optimal value achieved through a centrally constructed and executed joint policy.…”
Section: Overcookedmentioning
confidence: 96%
See 1 more Smart Citation
“…As before, the Greedy query closely tracks optimal. We give more details in the full version (Zhang, Durfee, and Singh 2020b), along with a comparison between our approach and multiagent planning techniques previously studied in Overcooked, where we saw that, even with small queries (k = 2), our decentralized query-based probabilistic commitment approach got within 99.5% of the optimal value achieved through a centrally constructed and executed joint policy.…”
Section: Overcookedmentioning
confidence: 96%
“…We provide proof sketches for Theorems 1 and 2 on these properties. Formal proofs of all the theorems and the lemmas are included in the full version of this paper (Zhang, Durfee, and Singh 2020b).…”
Section: Properties Of the Commitment Valuesmentioning
confidence: 99%