On the characterization of weighted simple games

Freixas, Josep; Freixas, Marc; Kurz, Sascha
December 2017
Theory & Decision;Dec2017, Vol. 83 Issue 4, p469
Academic Journal
This paper has a twofold scope. The first one is to clarify and put in evidence the isomorphic character of two theories developed in quite different fields: on one side, threshold logic, on the other side, simple games. One of the main purposes in both theories is to determine when a simple game is representable as a weighted game, which allows a very compact and easily comprehensible representation. Deep results were found in threshold logic in the sixties and seventies for this problem. However, game theory has taken the lead and some new results have been obtained for the problem in the past two decades. The second and main goal of this paper is to provide some new results on this problem and propose several open questions and conjectures for future research. The results we obtain depend on two significant parameters of the game: the number of types of equivalent players and the number of types of shift-minimal winning coalitions.


Related Articles

  • Some Fuzzy Operators with Threshold and Application to Fuzzy Association Rules in Data Mining. Bui Cong Cuong; Le Chi Ngoc // Advances in Fuzzy Mathematics;2010, Vol. 5 Issue 2, p245 

    T-norm with threshold firstly is introduced by Dubois and Prade [1] and more considered by Inacu [2]. Then some new classes of fuzzy operators with threshold, t-norms, t-conorms, implications and some new algebraic properties of these operators are discussed in [4 -6]. This paper is devoted to...

  • Censorship game in optimal choice problem. Dotsenko, S.; Marynych, O. // Cybernetics & Systems Analysis;Sep2013, Vol. 49 Issue 5, p749 

    The authors consider a game of the optimal choice where one of the players seeks to decrease the probability of selection of the best object by the other player by imposing some prohibitions and restrictions on browsing of certain elements. Optimal players' strategies that form the Nash...

  • A note on robust Nash equilibria with uncertainties. Perchet, Vianney // RAIRO -- Operations Research;Jul2014, Vol. 48 Issue 3, p365 

    In this short note, we investigate the framework where agents or players have some uncertainties upon their payoffs or losses, the behavior (or the type, number or any other characteristics) of other players. More specifically, we introduce an extension of the concept of Nash equilibria that...

  • Epistemically Robust Strategy Subsets. Asheim, Geir B.; Voorneveld, Mark; Weibull, Jörgen W. // Games (20734336);Dec2016, Vol. 7 Issue 4, p1 

    We define a concept of epistemic robustness in the context of an epistemic model of a finite normal-form game where a player type corresponds to a belief over the profiles of opponent strategies and types. A Cartesian product X of pure-strategy subsets is epistemically robust if there is a...

  • Amalgamating players, symmetry, and the Banzhaf value. Casajus, André // International Journal of Game Theory;Aug2012, Vol. 41 Issue 3, p497 

    We suggest new characterizations of the Banzhaf value without the symmetry axiom, which reveal that the characterizations by Lehrer (Int J Game Theory 17:89-99, ) and Nowak (Int J Game Theory 26:137-141, ) as well as most of the characterizations by Casajus (Theory Decis 71:365-372, ) are...

  • Bounded Degree, Triangle Avoidance Graph Games. Mehta, Nishali; Seress, Ákos // Graphs & Combinatorics;May2013, Vol. 29 Issue 3, p637 

    We consider variants of the triangle-avoidance game first defined by Harary and rediscovered by Hajnal a few years later. A graph game begins with two players and an empty graph on n vertices. The two players take turns choosing edges within K, building up a simple graph. The edges must be...

  • Coloring Triangle-Free Rectangle Overlap Graphs with $$O(\log \log n)$$ Colors. Krawczyk, Tomasz; Pawlik, Arkadiusz; Walczak, Bartosz // Discrete & Computational Geometry;Jan2015, Vol. 53 Issue 1, p199 

    Recently, it was proved that triangle-free intersection graphs of $$n$$ line segments in the plane can have chromatic number as large as $$\Theta (\log \log n)$$ . Essentially the same construction produces $$\Theta (\log \log n)$$ -chromatic triangle-free intersection graphs of a variety of...

  • Robust Consumption-Investment Problem on Infinite Horizon. Zawisza, Dariusz // Applied Mathematics & Optimization;Dec2015, Vol. 72 Issue 3, p469 

    In our paper we consider an infinite horizon consumption-investment problem under a model misspecification in a general stochastic factor model. We formulate the problem as a stochastic game and finally characterize the saddle point and the value function of that game using an ODE of semilinear...

  • Robust dynamic cooperative games. Bauso, D.; Timmer, J. // International Journal of Game Theory;2009, Vol. 38 Issue 1, p23 

    Classical cooperative game theory is no longer a suitable tool for those situations where the values of coalitions are not known with certainty. We consider a dynamic context where at each point in time the coalitional values are unknown but bounded by a polyhedron. However, the average value of...

  • PROBLEM SOLVING WITH ORDINAL MEASUREMENT. Bartee, Edwin M. // Management Science;Jun71, Vol. 17 Issue 10, pB-622 

    Modern socio-political-economic problems often represent situations in which the traditional numerical problem models fall far short of being adequate for determining formal solutions. The basic reason for this inadequacy is the fact that the objective functions in such problems contain abstract...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics