A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions
From MaRDI portal
Publication:975757
DOI10.1007/S10878-009-9208-YzbMATH Open1220.90106OpenAlexW2076617322MaRDI QIDQ975757FDOQ975757
Authors: Diana Fanghänel, F. Liers 
Publication date: 11 June 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: http://e-archive.informatik.uni-koeln.de/574/2/zaik2008-574.pdf
Recommendations
- Fast computation of the leastcore and prenucleolus of cooperative games
- Optimization implementation of solution concepts for cooperative games with stochastic payoffs
- Algorithms for finding coalitions exploiting a new reciprocity condition
- A dynamic solution in \(N\)-person cooperative game theory
- scientific article; zbMATH DE number 1187071
- scientific article
- On the structure of cooperative and competitive solutions for a generalized assignment game
- scientific article; zbMATH DE number 810453
Cites Work
- Geometric algorithms and combinatorial optimization
- The ellipsoid method and its consequences in combinatorial optimization
- Submodular functions and optimization.
- A new approach to the maximum-flow problem
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- Operations research. Deterministic models and methods.
- Title not available (Why is that?)
- Optimal attack and reinforcement of a network
- Optimal cooperation and submodularity for computing Potts partition functions with a large number of states
- New Optimization Algorithms in Physics
- Title not available (Why is that?)
- Practical performance of efficient minimum cut algorithms
- Separating from the dominant of the spanning tree polytope
- Separation of partition inequalities
Cited In (6)
- A COHESION INDEX FOR COOPERATION GRAPHS
- Discovery Science
- Cooperativity, absolute interaction, and algebraic optimization
- Optimal cooperation and submodularity for computing Potts partition functions with a large number of states
- Title not available (Why is that?)
- A bilevel programming problem with maximization of a supermodular function in the lower level
Uses Software
This page was built for publication: A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975757)
