2 votes
Accepted

Broadcasting on a dynamic grid

Here is how to analyze a starting configuration to determine whether the message will be able to eventually reach all nodes in the grid. Consider two adjacent nodes $u,v$. We'll say that these two ...
D.W.'s user avatar
  • 159k
2 votes
Accepted

Clarification of the definition of a POMDP

The availability of action $ a $ can be understood as $P_a(u, v) > 0$ for some $ v $ If an action $ a $ is not available in $ u $ then it will have not effect, this means that $P_a(u, v) = 0 $ for ...
Juan Leni's user avatar
  • 325
2 votes
Accepted

What is a distributed algorithm for generating random "private" pair-matchings?

Let's assume the agents are labeled $[0, n)$. Let $w > 2$ be a small constant, e.g. 4. Let $F_k(x)$ be an oblivious pseudo-random function (OPRF). Let each agent generate random value $s_i$, ...
orlp's user avatar
  • 13.4k
1 vote

Can agent be autonomous without having consciousness?

Here is a glimpse. Concerning agents you're trying to elaborate here,I would like to give you some insights of these following key aspects,which might help in your future research nor knowledge; ...
quintumnia's user avatar

Only top scored, non community-wiki answers of a minimum length are eligible