中文
相关论文

相关论文: Cohesion-Sensitive Power Indices: Representation R…

200 篇论文

In simple games, larger coalitions typically wield more power, but do all players align their efforts effectively? Consider a voting scenario where a coalition forms, but needs more voters to pass a bill. The cohesion of the new group of…

计算机科学与博弈论 · 计算机科学 2025-04-08 Michele Aleandri , Marco Dall'Aglio

Coalitional voting games appear in different forms in multi-agent systems, social choice and threshold logic. In this paper, the complexity of comparison of influence between players in coalitional voting games is characterized. The…

计算机科学与博弈论 · 计算机科学 2008-09-04 Haris Aziz

The Banzhaf power index was introduced in cooperative game theory to measure the real power of players in a game. The Banzhaf interaction index was then proposed to measure the interaction degree inside coalitions of players. It was shown…

最优化与控制 · 数学 2011-02-15 Jean-Luc Marichal , Pierre Mathonet

The Banzhaf index, Shapley-Shubik index and other voting power indices measure the importance of a player in a coalitional game. We consider a simple coalitional game called the spanning connectivity game (SCG) based on an undirected,…

计算机科学与博弈论 · 计算机科学 2009-06-22 Haris Aziz , Oded Lachish , Mike Paterson , Rahul Savani

Weighted voting games are ubiquitous mathematical models which are used in economics, political science, neuroscience, threshold logic, reliability theory and distributed systems. They model situations where agents with variable voting…

计算机科学与博弈论 · 计算机科学 2010-02-02 Haris Aziz , Mike Paterson

We introduce a class of cooperative games induced by weighted directed graphs. Specifically, the coalitional value combines an internal interaction term given by the induced subgraph game with an external component based on minimal incoming…

计算机科学与博弈论 · 计算机科学 2026-05-19 David Ryzák , Tomáš Kroupa

Weighted voting games are a family of cooperative games, typically used to model voting situations where a number of agents (players) vote against or for a proposal. In such games, a proposal is accepted if an appropriately weighted sum of…

计算机科学与博弈论 · 计算机科学 2019-01-01 Ilias Diakonikolas , Chrystalla Pavlou

We explore the switching-algebraic computation of the Banzhaf indices for general and monotone or unrestricted systems. This computation is achieved via (a) two Boolean-quotient formulas that are valid when the voting system is not…

计算机科学与博弈论 · 计算机科学 2023-06-27 Ali Muhammad Rushdi , Muhammad Ali Rushdi

We use simplicial complexes to model simple games as well as weighted voting games where certain coalitions are considered impossible. Topological characterizations of various ideas from simple games are provided, as are the expressions for…

物理与社会 · 物理学 2025-08-29 Anastasia Brooks , Franjo Sarcevic , Ismar Volic

We extend the coopetition index introduced by Aleandri and Dall'Aglio (2025) for simple games to the broader class of monotone transferable utility (TU) games and to all non-empty coalitions, including singletons. The new formulation allows…

计算机科学与博弈论 · 计算机科学 2025-11-20 Michele Aleandri , Marco Dall'Aglio

The Banzhaf power and interaction indexes for a pseudo-Boolean function (or a cooperative game) appear naturally as leading coefficients in the standard least squares approximation of the function by a pseudo-Boolean function of a specified…

最优化与控制 · 数学 2014-11-27 Jean-Luc Marichal , Pierre Mathonet

We consider the Banzhaf-Coleman and Owen power indices for weighted majority games modified by a coalition configuration. We present calculation algorithms of them that make use of the method of generating functions. We programmed the…

最优化与控制 · 数学 2015-07-02 Jorge Rodríguez Veiga , Guido I. Novoa Flores , Balbina V. Casas Méndez

The Penrose-Banzhaf index and the Shapley-Shubik index are the best-known and the most used tools to measure political power of voters in simple voting games. Most methods to calculate these power indices are based on counting winning…

组合数学 · 数学 2009-03-16 Werner Kirsch , Jessica Langner

Feature attribution methods have become essential for explaining machine learning models. Many popular approaches, such as SHAP and Banzhaf values, are grounded in power indices from cooperative game theory, which measure the contribution…

机器学习 · 计算机科学 2025-01-07 P. Barceló , R. Cominetti , M. Morgado

An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational complexity of false-name manipulation in weighted voting games…

计算机科学与博弈论 · 计算机科学 2009-05-21 Haris Aziz , Mike Paterson

Weighted voting games are frequently used in decision making. Each voter has a weight and a proposal is accepted if the weight sum of the supporting voters exceeds a quota. One line of research is the efficient computation of so-called…

最优化与控制 · 数学 2012-11-28 Sascha Kurz

Lloyd Shapley's cooperative value allocation theory stands as a central concept in game theory, extensively utilized across various domains to distribute resources, evaluate individual contributions, and ensure fairness. The Shapley value…

概率论 · 数学 2024-08-23 Tongseok Lim

Shapley values, which were originally designed to assign attributions to individual players in coalition games, have become a commonly used approach in explainable machine learning to provide attributions to input features for black-box…

机器学习 · 计算机科学 2023-03-24 Che-Ping Tsai , Chih-Kuan Yeh , Pradeep Ravikumar

Cooperative interval game is a cooperative game in which every coalition gets assigned some closed real interval. This models uncertainty about how much the members of a coalition get for cooperating together. In this paper we study…

计算机科学与博弈论 · 计算机科学 2018-11-12 Jan Bok

We study the Shapley value in weighted voting games. The Shapley value has been used as an index for measuring the power of individual agents in decision-making bodies and political organizations, where decisions are made by a majority vote…

计算机科学与博弈论 · 计算机科学 2014-08-05 Joel Oren , Yuval Filmus , Yair Zick , Yoram Bachrach
‹ 上一页 1 2 3 10 下一页 ›