Search Results - subject:"boolean functions"

Counting-based multidimensional poverty identification: From deprivation weights to bundles

Jones, Sam - 2019

In the widely used class of multidimensional poverty measures introduced by Alkire and Foster (2011), dimension-specific weights combined with a single cut-off parameter play a fundamental role in identifying who is multidimensionally poor. This paper revisits how these parameters are...

Persistent link: https://www.econbiz.de/10012146546

Counting-based multidimensional poverty identification : from deprivation weights to bundles

Jones, Sam - 2019

Persistent link: https://www.econbiz.de/10012098423

Applications of optimization to factorization ranks and quantum information theory

Gribling, Sander - 2019

Persistent link: https://www.econbiz.de/10012103328

On anonymous and weighted voting systems

Freixas, Josep; Pons, Montserrat - In: Theory and decision : an international journal for … 91 (2021) 4, pp. 477-491

Persistent link: https://www.econbiz.de/10012661499

On the probability of union in the n-space

Lee, Jinwook; Prékopa, András - In: Operations research letters 45 (2017) 1, pp. 19-24

Persistent link: https://www.econbiz.de/10011687061

A complete classification of equational classes of threshold functions included in clones

Couceiro, Miguel; Lehtonen, Erkko; Schölzel, Karsten - In: RAIRO / Operations research 49 (2015) 1, pp. 39-66

Persistent link: https://www.econbiz.de/10011308546

On Dedekind’s problem for complete simple games

Kurz, Sascha; Tautenhahn, Nikolas - In: International Journal of Game Theory 42 (2013) 2, pp. 411-437

special subclass of monotone Boolean functions. In order to apply the parametric Barvinok algorithm to obtain enumeration … list of suitably chosen sub-cases. As for the original enumeration problem of Dedekind on Boolean functions we have to …

Persistent link: https://www.econbiz.de/10010993414

A Law of Large Numbers for Weighted Majority

Haggstrom, Olle; Kalai, Gil; Mossel, Elchanan - Center for the Study of Rationality, Hebrew University … - 2004

Consider an election between two candidates in which the voters’ choices are random and independent and the probability of a voter choosing the first candidate is p 1/2. Condorcet’s Jury Theorem which he derived from the weak law of large numbers asserts that if the number of voters tends...

Persistent link: https://www.econbiz.de/10005752813

Modular Decomposition of Boolean Functions

Bioch, Bioch, J.C. - Erasmus Research Institute of Management (ERIM), … - 2002

, game theory and graph theory. Most appli- cations can be formulated in the framework of Boolean functions. In this paper we … give a uni_ed treatment of modular decomposition of Boolean functions based on the idea of generalized Shannon … prove that the recognition problem for general Boolean functions is coNP-complete. …

Persistent link: https://www.econbiz.de/10010837552

Version Spaces and Generalized Monotone Boolean Functions

Bioch, Bioch, J.C.; Ibaraki, T. - Erasmus Research Institute of Management (ERIM), … - 2002

property x <= y implies f(x) <= f(y). These include the standard monotone (or positive) Boolean functions, regular Boolean … functions and other interesting functions as special cases. It is shown that a class of functions is closed under conjunction …

Persistent link: https://www.econbiz.de/10011067465