Finding ways of reducing undesired behavior in online interactions is at the forefront of the social computing research agenda. One promising way to reduce perceived “bad behavi...
Jens Riegelsberger, Scott Counts, Shelly Farnham, ...
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
This paper is a comparative study of game-theoretic solution concepts in strictly competitive multiagent scenarios, as commonly encountered in the context of parlor games, competi...
Felix Brandt, Felix A. Fischer, Paul Harrenstein, ...
Epistemic logic allows to reason not only about situations, but also about the knowledge that a set of agents have about situations. In later years, epistemic logic has been appli...
This work discusses clearing policy used by a specialist agent on marketing strategies under the rules of TAC CAT agents International Tournament. The goal of this agent is to cre...
Miriam Salcedo H., Darnes Vilarino A., Fabiola Lop...