Related papers: Relating Structure and Power: Extended Version
We analyze cooperative Cournot games with boundedly rational firms. Due to cogni- tive constraints, the members of a coalition cannot accurately predict the coalitional structure of the non-members. Thus, they compute their value using…
We consider a class of coalition formation games called hedonic games, i.e., games in which the utility of a player is completely determined by the coalition that the player belongs to. We first define the class of subset-additive hedonic…
We introduce a generalization of the bisimulation game that finds distinguishing Hennessy-Milner logic formulas from every finitary, subformula-closed language in van Glabbeek's linear-time--branching-time spectrum between two finite-state…
In this paper, we explore the descriptive complexity theory of finite groups by examining the power of the second Ehrenfeucht--Fra\"iss\'e bijective pebble game in Hella's (Ann. Pure Appl. Log., 1989) hierarchy. This is a…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
Parity games play a central role in model checking and satisfiability checking. Solving parity games is computationally expensive, among others due to the size of the games, which, for model checking problems, can easily contain $10^9$…
Graded modal types systems and coeffects are becoming a standard formalism to deal with context-dependent computations where code usage plays a central role. The theory of program equivalence for modal and coeffectful languages, however, is…
The non-commutative sequoid operator $\oslash$ on games was introduced to capture algebraically the presence of state in history-sensitive strategies in game semantics, by imposing a causality relation on the tensor product of games.…
Combinatorics, like computer science, often has to deal with large objects of unspecified (or unusable) structure. One powerful way to deal with such an arbitrary object is to decompose it into more usable components. In particular, it has…
We state and prove Kuhn's equivalence theorem for a new representation of games, the intrinsic form. First, we introduce games in intrinsic form where information is represented by $\sigma$-fields over a product set. For this purpose, we…
Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…
We study II_1 factors M and N associated with good generalized Bernoulli actions of groups having an infinite almost normal subgroup with the relative property (T). We prove the following rigidity result: every finite index M-N-bimodule (in…
We study turn-based quantitative games of infinite duration opposing two antagonistic players and played over graphs. This model is widely accepted as providing the adequate framework for formalizing the synthesis question for reactive…
The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…
The category of open games, which provides a strongly compositional foundation of economic game theory, is intermediate between symmetric monoidal and compact closed. More precisely it has counits with no corresponding units, and a…
Scientific coauthorship, generated by collaborations and competitions among researchers, reflects effective organizations of human resources. Researchers, their expected benefits through collaborations, and their cooperative costs…
The work we present in this paper initiated the formal study of fractional hedonic games, coalition formation games in which the utility of a player is the average value he ascribes to the members of his coalition. Among other settings,…
Cores of cooperative games are ubiquitous in information theory, and arise most frequently in the characterization of fundamental limits in various scenarios involving multiple users. Examples include classical settings in network…
A generalized model of games is proposed, in which cooperative games and non-cooperative games are special cases. Some games that are neither cooperative nor non-cooperative can be expressed and analyzed. The model is based on relationships…
In recent work by Bramoull\'{e} and Kranton, a model for the provision of public goods on a network was presented and relations between equilibria of such a game and properties of the network were established. This model was further…