Paper Info
Title
Categorical Combinatorics for Non Deterministic Strategies on Simple Games.
Abstract
The purpose of this paper is to define in a clean and conceptual way a non-deterministic and sheaf-theoretic variant of the category of simple games and deterministic strategies. One thus starts by associating to every simple game a presheaf category of non-deterministic strategies. The bicategory of simple games and non-deterministic strategies is then obtained by a construction inspired by the recent work by Mellies and Zeilberger on type refinement systems. We show that the resulting bicategory is symmetric monoidal closed and cartesian. We also define a 2-comonad which adapts the Curien-Lamarche exponential modality of linear logic to the 2-dimensional and non deterministic framework. We conclude by discussing in what sense the bicategory of simple games defines a model of non deterministic intuitionistic linear logic.
Year
Venue
Field
2018
FoSSaCS
Combinatorics,Exponential function,Computer science,Categorical variable,Presheaf,Bicategory,Linear logic,Cartesian coordinate system
DocType
Citations 
PageRank 
Conference
0
0.34
References 
Authors
6
2
Name
Order
Citations
PageRank
Clément Jacq100.68
Paul-andré Melliès239230.70