Weighted Banzhaf power and interaction indexes through weighted approximations of games

in Dubois, Didier; Grabisch, Michel; Mesiar, Radko (Eds.) et al 32nd Linz Seminar on Fuzzy Set Theory (LINZ 2011) - Decision Theory: Qualitative and Quantitative Approaches (2011)

In cooperative game theory, various kinds of power indexes are used to measure the influence that a given player has on the outcome of the game or to define a way of sharing the benefits of the game among ... [more ▼]

In cooperative game theory, various kinds of power indexes are used to measure the influence that a given player has on the outcome of the game or to define a way of sharing the benefits of the game among the players. The best known power indexes are due to Shapley [15,16] and Banzhaf [1,5] and there are many other examples of such indexes in the literature. When one is concerned by the analysis of the behavior of players in a game, the information provided by power indexes might be far insufficient, for instance due to the lack of information on how the players interact within the game. The notion of interaction index was then introduced to measure an interaction degree among players in coalitions; see [13,12,7,8,14,10,6] for the definitions and axiomatic characterizations of the Shapley and Banzhaf interaction indexes as well as many others. In addition to the axiomatic characterizations the Shapley power index and the Banzhaf power and interaction indexes were shown to be solutions of simple least squares approximation problems (see [2] for the Shapley index, [11] for the Banzhaf power index and [9] for the Banzhaf interaction index). We generalize the non-weighted approach of [11,9] by adding a weighted, probabilistic viewpoint: A weight w(S) is assigned to every coalition S of players that represents the probability that coalition S forms. The solution of the weighted least squares problem associated with the probability distribution w was given in [3,4] in the special case when the players behave independently of each other to form coalitions. In this particular setting we introduce a weighted Banzhaf interaction index associated with w by considering, as in [11,9], the leading coefficients of the approximations of the game by polynomials of specified degrees.We then study the most important properties of these weighted indexes and their relations with the classical Banzhaf and Shapley indexes. [less ▲]

Weighted Fair Multicast Multigroup Beamforming Under Per-antenna Power Constraints

in Multicast multigroup beamforming under per-antenna power constraints (2014, June)

Linear precoding exploits the spatial degrees of freedom offered by multi-antenna transmitters to serve multiple users over the same frequency resources. The present work focuses on simultaneously serving ... [more ▼]

Linear precoding exploits the spatial degrees of freedom offered by multi-antenna transmitters to serve multiple users over the same frequency resources. The present work focuses on simultaneously serving multiple groups of users, each with its own channel, by transmitting a stream of common symbols to each group. This scenario is known as physical layer multicasting to multiple co-channel groups. Extending the current state of the art in multigroup multicasting, the practical constraint of a maximum permitted power level radiated by each antenna is tackled herein. The considered per antenna power constrained system is optimized in a maximum fairness sense. In other words, the optimization aims at favoring the worst user by maximizing the minimum rate. This Max-Min Fair criterion is imperative in multicast systems, where the performance of all the receivers listening to the same multicast is dictated by the worst rate in the group. An analytic framework to tackle the Max-Min Fair multigroup multicasting scenario under per antenna power constraints is therefore derived. Numerical results display the accuracy of the proposed solution and provide insights to the performance of a per antenna power constrained system. [less ▲]

Weighted lattice polynomials

in Discrete Mathematics (2009), 309(4), 814-820

We define the concept of weighted lattice polynomial functions as lattice polynomial functions constructed from both variables and parameters. We provide equivalent forms of these functions in an ... [more ▼]

We define the concept of weighted lattice polynomial functions as lattice polynomial functions constructed from both variables and parameters. We provide equivalent forms of these functions in an arbitrary bounded distributive lattice. We also show that these functions include the class of discrete Sugeno integrals and that they are characterized by a median based decomposition formula. [less ▲]

The weighted lattice polynomials as aggregation functions

in Proc. 63rd Meeting of the Eur. Working Group "Multiple Criteria Decision Aiding" (MCDA 63) (2006, March)

We define the concept of weighted lattice polynomials as lattice polynomials constructed from both variables and parameters. We provide equivalent forms of these functions in an arbitrary bounded ... [more ▼]

We define the concept of weighted lattice polynomials as lattice polynomials constructed from both variables and parameters. We provide equivalent forms of these functions in an arbitrary bounded distributive lattice. We also show that these functions include the class of discrete Sugeno integrals and that they are characterized by a remarkable median based decomposition formula. [less ▲]

Weighted numbers: Commentary on “The Number Sense Represents (Rational) Numbers” by Sam Clarke and Jacob Beck

in Behavioral and Brain Sciences (2021)

Weighted Subspace Fitting for General Array Error Models

in IEEE Transactions on Signal Processing (1998), 46(9), 24842498

Weighted Sum-SINR and Fairness Optimization for SWIPT-Multigroup Multicasting Systems with Heterogeneous Users

in IEEE Open Journal of the Communications Society (2020)

The development of next generation wireless communication systems focuses on the expansion of existing technologies, while ensuring an accord between various devices within a system. In this paper, we ... [more ▼]

The development of next generation wireless communication systems focuses on the expansion of existing technologies, while ensuring an accord between various devices within a system. In this paper, we target the aspect of precoder design for simultaneous wireless information and power transmission (SWIPT) in a multi-group (MG) multicasting (MC) framework capable of handling heterogeneous types of users, viz., information decoding (ID) specific, energy harvesting (EH) explicit, and/or both ID and EH operations concurrently. Precoding is a technique well-known for handling the inter-user interference in multi-user systems, however, the joint design with SWIPT is not yet fully exploited. Herein, we investigate the potential benefits of having a dedicated precoder for the set of users with EH demands, in addition to the MC precoding. We study the system performance of the aforementioned system from the perspectives of weighted sum of signal-to-interference-plus-noise-ratio (SINR) and fairness. In this regard, we formulate the precoder design problems for (i) maximizing the weighted sum of SINRs at the intended users and (ii) maximizing the minimum of SINRs at the intended users; both subject to the constraints on minimum (non-linear) harvested energy, an upper limit on the total transmit power and a minimum SINR required to close the link. We solve the above-mentioned problems using distinct iterative algorithms with the help of semi-definite relaxation (SDR) and slack-variable replacement (SVR) techniques, following suitable transformations pertaining the problem convexification. The main novelty of the proposed approach lies in the ability to jointly design the MC and EH precoders for serving the heterogeneously classified ID and EH users present in distinct groups, respectively. We illustrate the comparison between the proposed weighted sum-SINR and fairness models via simulation results, carried out under various parameter values and operating conditions. [less ▲]

Weightwise perfectly balanced functions and nonlinearity

in Codes, Cryptology and Information Security (2022)

In this article we realize a general study on the nonlinearity of weightwise perfectly balanced (WPB) <br />functions. First, we derive upper and lower bounds on the nonlinearity from this class of ... [more ▼]

In this article we realize a general study on the nonlinearity of weightwise perfectly balanced (WPB) <br />functions. First, we derive upper and lower bounds on the nonlinearity from this class of functions for all n. Then, <br />we give a general construction that allows us to provably provide WPB functions with nonlinearity as low as <br />2 <br />n/2−1 <br />and WPB functions with high nonlinearity, at least 2 <br />n−1 − 2 <br />n/2 <br />. We provide concrete examples in 8 and <br />16 variables with high nonlinearity given by this construction. In 8 variables we experimentally obtain functions <br />reaching a nonlinearity of 116 which corresponds to the upper bound of Dobbertin’s conjecture, and it improves <br />upon the maximal nonlinearity of WPB functions recently obtained with genetic algorithms. Finally, we study the <br />distribution of nonlinearity over the set of WPB functions. We examine the exact distribution for n = 4 and provide <br />an algorithm to estimate the distributions for n = 8 and 16, together with the results of our experimental studies for <br />n = 8 and 16. [less ▲]

"... weil die meisten Comics einfach zu schwer sind!" - Zur Kategorie der Einfachheit beim Einsatz von Bandes dessinées im Fremdsprachenunterricht Französisch

in Burwitz-Melzer, Eva; O´Sullivan, Emer (Eds.) Einfachheit in der Kinder- und Jugendliteratur - Ein Gewinn für den Fremdsprachenunterricht (2016, December 18)

Wéineg Diversitéit an de Schoulbicher

Speeches/Talks (2023)