The nucleolus and kernel for simple games or special valid inequalities for 0-1 linear integer programs

DOI10.1007/BF01761605MaRDI QIDQ1237653zbMATH OpenOpenAlexFDO

Authors Laurence A. Wolsey

Publication date 1976

Published in International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01761605

Mathematics Subject Classification ID

Cooperative games (91A12) Integer programming (90C10)

Cites work

• scientific article; zbMATH DE number 3385535 (Why is no real title available?)
• A CLASS OF MAJORITY GAMES
• A Method for Computing the Kernel of n-Person Games
• A characterization, existence proof and dimension bounds for the kernel of a game
• Coefficient reduction for inequalities in 0–1 variables
• Faces for a linear inequality in 0–1 variables
• Facet of regular 0–1 polytopes
• Facets of the knapsack polytope
• Generalized dynamic programming methods in integer programming
• On Weights of Constant-Sum Majority Games
• On the Nucleolus of a Characteristic Function Game
• On the kernel of constant-sum simple games with homogeneous weights

Cited in

(6)

• On the computational complexity of weighted voting games
• Voting power in the EU council of ministers and fair decision making in distributive politics
• Directed and weighted majority games
• Reducing the number of linear programs needed for solving the nucleolus problem of n-person game theory
• An LP approach to compute the pre-kernel for cooperative games
• Tournament solutions based on cooperative game theory

This page was built for publication: The nucleolus and kernel for simple games or special valid inequalities for 0-1 linear integer programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1237653)