Results 1 to 10 of about 4,564,911 (224)
Template Games, Simple Games, and Day Convolution
International Conference on Formal Structures for Computation and Deduction, 2019 Template games unify various approaches to game semantics, by exhibiting them as instances of a double-categorical variant of the slice construction. However, in the particular case of simple games, template games do not quite yield the standard (bi ...
Eberhart, Clovis +2 more
semanticscholar +5 more sources
Polytopality of Simple Games [PDF]
Experimental Mathematics, 2023 The Bier sphere Bier(G)=Bier(K):=K∗ΔK° and the canonical fan Fan(Γ)=Fan(K) are combinatorial/geometric companions of a simple game G=(P,Γ) (equivalently the associated simplicial complex K), where P is the set of players, Γ⊆2P is the set of wining ...
Marinko Timotijevi'c +2 more
semanticscholar +3 more sources
Simple Games versus Weighted Voting Games [PDF]
SSRN Electronic Journal, 2018 A simple game (N, v) is given by a set N of n players and a partition of \(2^N\) into a set \(\mathcal {L}\) of losing coalitions L with value \(v(L)=0\) that is closed under taking subsets and a set \(\mathcal {W}\) of winning coalitions W with \(v(W)=1\
F. Hof +3 more
semanticscholar +9 more sources
Simple Voting Games and Cartel Damage Proportioning [PDF]
Games, 2021 Individual contributions by infringing firms to the compensation of cartel victims must reflect their “relative responsibility for the harm caused” according to EU legislation. Several studies have argued that the theoretically best way to operationalize
Stefan Napel, Dominik Welter
doaj +2 more sources
Three-valued simple games [PDF]
SSRN Electronic Journal, 2015 In this paper we study three-valued simple games as a natural extension of simple games. We analyze to which extent well-known results on the core and the Shapley value for simple games can be extended to this new setting. To describe the core of a three-
M. Musegaas, P. Borm, M. Quant
semanticscholar +7 more sources
Simple strategies for Banach-Mazur games and fairly correct systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 In 2006, Varacca and Völzer proved that on finite graphs, omega-regular large sets coincide with omega-regular sets of probability 1, by using the existence of positional strategies in the related Banach-Mazur games.
Thomas Brihaye, Quentin Menet
doaj +2 more sources
Simple Fixpoint Iteration To Solve Parity Games [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 A naive way to solve the model-checking problem of the mu-calculus uses fixpoint iteration. Traditionally however mu-calculus model-checking is solved by a reduction in linear time to a parity game, which is then solved using one of the many algorithms ...
Tom van Dijk, Bob Rubbens
doaj +3 more sources
, 2007 We define the class of "simple recursive games". A simple recursive game is defined as a simple stochastic game (a notion due to Anne Condon), except that we allow arbitrary real payoffs but disallow moves of chance. We study the complexity of solving simple recursive games and obtain an almost-linear time comparison-based algorithm for computing an ...
Daniel Andersson +3 more
openalex +3 more sources
A reduction from parity games to simple stochastic games [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Games on graphs provide a natural model for reactive non-terminating systems. In such games, the interaction of two players on an arena results in an infinite path that describes a run of the system.
Krishnendu Chatterjee +1 more
doaj +3 more sources
Comparison of Algorithms for Simple Stochastic Games [PDF]
International Symposium on Games, Automata, Logics and Formal Verification, 2020 Simple stochastic games are turn-based 2.5-player zero-sum graph games with a reachability objective. The problem is to compute the winning probability as well as the optimal strategies of both players.
Jan Křetínský +3 more
openalex +3 more sources