Add to ORKGWhen agents collaborate to perform a control task, it is of interest to characterize the set of joint probability distributions they can achieve on their joint action space when they are passively provided with external common randomness. We give a simple counterexample to a natural conjecture about this class of joint distributions
We analyse average-based distributed algorithms relying on simple and pairwise random interactions a...
We prove that under some technical assumptions on a general, non-classical probability space, the pr...
This paper presents results from an experiment studying a two-person 4x4 pure coordination game. We ...
When agents collaborate to perform a control task, it is of interest to characterize the set of join...
When agents collaborate to perform a control task, it is of interest to characterize the set of join...
We study the probability that two or more agents can attain common knowledge of nontrivial events wh...
Abstract. In a distributed game we imagine a team Player engaging a team Opponent in a distributed f...
In extensive form noncooperative game theory, at each instant t, each agent i sets its state x, inde...
Abstract—An important subclass of secure multiparty computation is secure sampling: two parties outp...
The type function of an agent, in a type space, associates with each state a probability distributio...
The notion of common cause closedness of a classical, Kolmogorovian probability space with respect t...
We propose a game theoretical model of one-shot network public goods formalizing the 'closure argume...
Abstract We study the problem of spreading a particular behavior among agents located in a random so...
In this talk I'll present our recent results on *Common Randomness Generation*, a very basic task wh...
We study an n-player random game with random payoffs and continuous strategy profiles sets. The payo...
We analyse average-based distributed algorithms relying on simple and pairwise random interactions a...
We prove that under some technical assumptions on a general, non-classical probability space, the pr...
This paper presents results from an experiment studying a two-person 4x4 pure coordination game. We ...
When agents collaborate to perform a control task, it is of interest to characterize the set of join...
When agents collaborate to perform a control task, it is of interest to characterize the set of join...
We study the probability that two or more agents can attain common knowledge of nontrivial events wh...
Abstract. In a distributed game we imagine a team Player engaging a team Opponent in a distributed f...
In extensive form noncooperative game theory, at each instant t, each agent i sets its state x, inde...
Abstract—An important subclass of secure multiparty computation is secure sampling: two parties outp...
The type function of an agent, in a type space, associates with each state a probability distributio...
The notion of common cause closedness of a classical, Kolmogorovian probability space with respect t...
We propose a game theoretical model of one-shot network public goods formalizing the 'closure argume...
Abstract We study the problem of spreading a particular behavior among agents located in a random so...
In this talk I'll present our recent results on *Common Randomness Generation*, a very basic task wh...
We study an n-player random game with random payoffs and continuous strategy profiles sets. The payo...
We analyse average-based distributed algorithms relying on simple and pairwise random interactions a...
We prove that under some technical assumptions on a general, non-classical probability space, the pr...
This paper presents results from an experiment studying a two-person 4x4 pure coordination game. We ...