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

DOI10.1007/BF01761605zbMath0356.90080OpenAlexW1995924882MaRDI QIDQ1237653

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

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

Related Items (6)

Tournament solutions based on cooperative game theory ⋮ Directed and weighted majority games ⋮ Voting power in the EU council of ministers and fair decision making in distributive politics ⋮ On the computational complexity of weighted voting 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

Cites Work

• Unnamed Item
• On the kernel of constant-sum simple games with homogeneous weights
• A characterization, existence proof and dimension bounds for the kernel of a game
• A CLASS OF MAJORITY GAMES
• 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
• A Method for Computing the Kernel of n-Person Games
• On Weights of Constant-Sum Majority Games
• On the Nucleolus of a Characteristic Function Game
• Generalized dynamic programming methods in integer programming

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