Cover Image

Computing Power Indices in Weighted Majority Games with Formal Power Series

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kakimura, Naonori, Terai, Yoshihiko
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Geometry of Coalition Power: Majorization, Lattices, and Displacement in Multiwinner Elections
by: Guo, Qian, et al.
Published: (2026)

On Approximating the Weighted Region Problem in Square Tessellations
by: Kakimura, Naonori, et al.
Published: (2024)

Edge-Weighted Online Bipartite Matching
by: Fahrbach, Matthew, et al.
Published: (2020)

Weighted Envy Freeness With Bounded Subsidies
by: Elmalem, Noga Klein, et al.
Published: (2024)

Equitable Colorings of Vertex-Weighted Graphs
by: Barman, Siddharth, et al.
Published: (2026)

Deviation Dynamics in Cardinal Hedonic Games
by: Zech, Valentin, et al.
Published: (2025)

Lipschitz Continuous Allocations for Optimization Games
by: Kumabe, Soh, et al.
Published: (2024)

The Min Max Average Cycle Weight Problem
by: Elmalem, Noga Klein, et al.
Published: (2025)

Welfare Approximation in Additively Separable Hedonic Games
by: Bullinger, Martin, et al.
Published: (2025)

Envy-freeness in 3D Hedonic Games
by: McKay, Michael, et al.
Published: (2022)

Individual Rationality in Topological Distance Games is Surprisingly Hard
by: Deligkas, Argyrios, et al.
Published: (2024)

Condorcet Winners and Anscombes Paradox Under Weighted Binary Voting
by: Baharav, Carmel, et al.
Published: (2025)

Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations
by: Feng, Yuda, et al.
Published: (2024)

On the Complexity of Nucleolus Computation for Bipartite b-Matching Games
by: Koenemann, Jochen, et al.
Published: (2021)

The NTU Partitioned Matching Game for International Kidney Exchange Programs
by: Csáji, Gergely, et al.
Published: (2024)

A Note on Approximating Weighted Nash Social Welfare with Additive Valuations
by: Feng, Yuda, et al.
Published: (2024)

Weighted Proportional Allocations of Indivisible Goods and Chores: Insights via Matchings
by: V., Vishwa Prakash H., et al.
Published: (2023)

Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games
by: Constantinescu, Andrei, et al.
Published: (2023)

Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games
by: Anagnostides, Ioannis, et al.
Published: (2023)

Single-Deviation Stability in Additively Separable Hedonic Games with Constrained Coalition Sizes
by: Bullinger, Martin, et al.
Published: (2025)

Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs
by: Brown, Adam, et al.
Published: (2024)

Computing Approximately Proportional Allocations of Indivisible Goods: Beyond Additive and Monotone Valuations
by: Andersen, Martin Jupakkal, et al.
Published: (2025)

Nemesis, an Escape Game in Graphs
by: Bergé, Pierre, et al.
Published: (2026)

A Smoothed FPTAS for Equilibria in Congestion Games
by: Giannakopoulos, Yiannis
Published: (2023)

Core Stability in Additively Separable Hedonic Games of Low Treewidth
by: Hanaka, Tesshu, et al.
Published: (2024)

Learning in Stackelberg Games with Non-myopic Agents
by: Haghtalab, Nika, et al.
Published: (2022)

Roping in Uncertainty: Robustness and Regularization in Markov Games
by: McMahan, Jeremy, et al.
Published: (2024)

Public Goods Games in Directed Networks with Constraints on Sharing
by: Deligkas, Argyrios, et al.
Published: (2025)

Solving Matrix Games with Near-Optimal Matvec Complexity
by: Karmarkar, Ishani, et al.
Published: (2026)

Best of Both Worlds Guarantees for Equitable Allocations
by: Bhaskar, Umang, et al.
Published: (2025)

Universal Online Contention Resolution with Preselected Order
by: Zhao, Junyao
Published: (2025)

Online Job Assignment
by: Ekbatani, Farbod, et al.
Published: (2025)

Online Allocation with Multi-Class Arrivals: Group Fairness vs Individual Welfare
by: Zargari, Faraz, et al.
Published: (2025)

Best-of-Both-Worlds Guarantees with Fairer Endings
by: Kavitha, Telikepalli, et al.
Published: (2025)

Maximizing social welfare among EF1 allocations at the presence of two types of agents
by: Ma, Jiaxuan, et al.
Published: (2025)

A Competitive Posted-Price Mechanism for Online Budget-Feasible Auctions
by: Charalampopoulos, Andreas, et al.
Published: (2025)

Nash Social Welfare with Submodular Valuations: Approximation Algorithms and Integrality Gaps
by: Bei, Xiaohui, et al.
Published: (2025)

The Landscape of Almost Equitable Allocations
by: Hosseini, Hadi, et al.
Published: (2025)

Fairness and Efficiency in Two-Sided Matching Markets
by: Jain, Pallavi, et al.
Published: (2025)

Stable Hypergraph Matching in Unimodular Hypergraphs
by: Biró, Péter, et al.
Published: (2025)