We introduce Transformation Games (TGs), a form of coalitional game in which players are endowed with sets of initial resources, and have capabilities allowing them to derive certa...
Yoram Bachrach, Michael Zuckerman, Michael Wooldri...
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
A general game player is a system that understands the rules of unknown games and learns to play these games well without human intervention. A major challenge for research in Gen...
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...
The transformation of constructive program synthesis proofs is discussed and compared with the more traditional approaches to program transformation. An example system for adaptin...