Pages that link to "Item:Q504511"
From MaRDI portal
The following pages link to Epistemic protocols for dynamic gossip (Q504511):
Displaying 12 items.
- The epistemic gossip problem (Q1712508) (← links)
- Propositional gossip protocols (Q2140515) (← links)
- The logic of gossiping (Q2211849) (← links)
- A lightweight epistemic logic and its application to planning (Q2238679) (← links)
- Dynamic gossip (Q2415893) (← links)
- A logical study of group-size based social network creation (Q2423774) (← links)
- Everyone knows that everyone knows (Q2658278) (← links)
- Minimal number of calls in propositional protocols (Q2695494) (← links)
- (Q5016795) (← links)
- (Q5018499) (← links)
- (Q5020961) (← links)
- You can only be lucky once: optimal gossip for epistemic goals (Q6646015) (← links)
