On the public citation graph

Enumeration and exact design of weighted voting games

https://doi.org/10.5555/1838206.1838261
0 signed · 40 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01171114openalex-snapshot
Ein Satz �ber Untermengen einer endlichen Menge
inferredcites →https://doi.org/10.1007/bf01753703openalex-snapshot
NP-completeness of some problems concerning voting games
inferredcites →https://doi.org/10.1007/bf02579150openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1007/bf02628555openalex-snapshot
Generating functions for computing power indices efficiently
inferredcites →https://doi.org/10.1007/s00355-009-0402-8openalex-snapshot
The inverse Banzhaf problem
inferredcites →https://doi.org/10.1016/0166-218x(85)90040-xopenalex-snapshot
Polynomial-time algorithms for regular set-covering and threshold synthesis
inferredcites →https://doi.org/10.1017/cbo9780511528446.003openalex-snapshot
A value for n -person games
inferredcites →https://doi.org/10.1023/a:1004965310450openalex-snapshot
Is the allocation of voting power among EU states fair?
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0382107-0openalex-snapshot
On Dedekind's Problem: The Number of Isotone Boolean Functions. II
inferredcites →https://doi.org/10.1109/inmic.2007.4557718openalex-snapshot
Efficient Algorithm for Designing Weighted Voting Games
inferredcites →https://doi.org/10.1109/tnn.2004.824419openalex-snapshot
On Encoding and Enumerating Threshold Functions
inferredcites →https://doi.org/10.1177/0951692800012004004openalex-snapshot
Fair Allocation and Re-Weighting of Votes and Voting Power in the EU before and after the Next Enlargement
inferredcites →https://doi.org/10.1287/moor.19.2.257openalex-snapshot
On the Complexity of Cooperative Solution Concepts
inferredcites →https://doi.org/10.22004/ag.econ.269461openalex-snapshot
Power Indices as an Aid to Institutional Design: The Generalised Apportionment Problem
inferredcites →https://doi.org/10.65109/ylpb4187openalex-snapshot
An anytime approximation method for the inverse Shapley value problem

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.2361865openalex-extracted
inferred← citeshttps://doi.org/10.2139/ssrn.2391113openalex-extracted
inferred← citeshttps://doi.org/10.2139/ssrn.2391154openalex-extracted
Enumeration of Weighted Games with Minimum and an Analysis of Voting Power for Bipartite Complete Games with Minimum
inferred← citeshttps://doi.org/10.48550/arxiv.1103.0868openalex-extracted
On minimum integer representations of weighted games
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_23openalex-snapshot
The Inverse Shapley Value Problem
inferred← citeshttps://doi.org/10.1007/s00355-015-0946-8openalex-snapshot
The inverse problem for power distributions in committees
inferred← citeshttps://doi.org/10.1007/s10479-012-1108-3openalex-snapshot
On Minimum Sum Representations for Weighted Voting Games
inferred← citeshttps://doi.org/10.1007/s10479-012-1293-0openalex-snapshot
Heuristic and exact solutions to the inverse power index problem for small voting bodies
inferred← citeshttps://doi.org/10.1007/s10479-013-1348-xopenalex-snapshot
Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
inferred← citeshttps://doi.org/10.1007/s11127-021-00951-5openalex-snapshot
Inconsistent weighting in weighted voting games
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.09.010openalex-snapshot
The minimum sum representation as an index of voting power
inferred← citeshttps://doi.org/10.1016/j.geb.2017.06.004openalex-snapshot
The Inverse Shapley value problem
inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2013.10.005openalex-snapshot
On minimum integer representations of weighted games
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.11.033openalex-snapshot
Complementary cooperation, minimal winning coalitions, and power indices
inferred← citeshttps://doi.org/10.1017/s0269888913000106openalex-snapshot
Cooperative games and multiagent systems
inferred← citeshttps://doi.org/10.1111/coin.12096openalex-snapshot
False‐Name Manipulation in Weighted Voting Games: Empirical and Theoretical Analysis
inferred← citeshttps://doi.org/10.1115/1.4035117openalex-snapshot
Design Exploration and Kinematic Tuning of a Power Modulating Jumping Monopod
inferred← citeshttps://doi.org/10.1145/2213977.2214043openalex-snapshot
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
inferred← citeshttps://doi.org/10.1613/jair.3166openalex-snapshot
False-Name Manipulations in Weighted Voting Games
inferred← citeshttps://doi.org/10.1613/jair.4109openalex-snapshot
Finding Optimal Solutions for Voting Game Design Problems
inferred← citeshttps://doi.org/10.26076/0dd9-e762openalex-snapshot
Experimental Analysis of the Effects of Manipulations in Weighted Voting Games
inferred← citeshttps://doi.org/10.48550/arxiv.1206.1145openalex-snapshot
Evaluation and Improvement of Laruelle-Widgrén Inverse Banzhaf Approximation
inferred← citeshttps://doi.org/10.48550/arxiv.1601.06223openalex-snapshot
Shapley Values in Weighted Voting Games with Random Weights
inferred← citeshttps://doi.org/10.48550/arxiv.1811.03491openalex-snapshot
Degree-$d$ Chow Parameters Robustly Determine Degree-$d$ PTFs (and Algorithmic Applications)
inferred← citeshttps://doi.org/10.5539/jmr.v5n1p122openalex-snapshot
A Complete Geometric Representation of Four-Player Weighted Voting Systems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.