The nucleolus and kernel for simple games or special valid inequalities for 0-1 linear integer programs
From MaRDI portal
Publication:1237653
DOI10.1007/BF01761605zbMATH Open0356.90080OpenAlexW1995924882MaRDI QIDQ1237653FDOQ1237653
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
Cites Work
- Title not available (Why is that?)
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- On the Nucleolus of a Characteristic Function Game
- A characterization, existence proof and dimension bounds for the kernel of a game
- A CLASS OF MAJORITY GAMES
- On Weights of Constant-Sum Majority Games
- Generalized dynamic programming methods in integer programming
- Coefficient reduction for inequalities in 0–1 variables
- On the kernel of constant-sum simple games with homogeneous weights
- A Method for Computing the Kernel of n-Person Games
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)
