Team Persuasion Game Sample Clauses

Team Persuasion Game. Let 7TP denote a team persuasion framework. Let T be a discrete time set. Let {S}t∈T , be a random variable that describe the configurations of this game over time. We call S0 the initial con- figuration, and St is the tth configuration. The update rule is such that for all a ∈ A \ {t}, St+1(a) ∈ X is the output of αa given St(b) ∈ X for all b ∈ φ(a) and possibly β(a). Further, (∀t ∈ T ) St(t) := topic. Arguments make their decision at the end of round t and change at the start of round t + 1. A team persuasion game with initial configuration S0 is the tuple (7TP, S0). Initially, the agents start in some initial configuration defined by whether each agent asserts its argument. In each subsequent round, the agents decide using their own decision procedure whether to assert or stop asserting their argument in the next round, given the actions of other agents they see. Both teams are presenting their arguments to an audience who are assumed to be memoryless across rounds and can only see the topic and the arguments that are being currently presented. This prompts the following definition. t t t t t t