Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

23

COR
2006

favoriteEmaildiscussreport

91views more COR 2006»

An LP approach to compute the pre-kernel for cooperative games

13 years 11 months ago

An LP approach to compute the pre-kernel for cooperative games

Download www.gtcenter.org

We present an algorithm to compute the (pre)-kernel of a TU-game N, v with a system of n 2 1 linear programming problems. In contrast to the algorithms using convergence methods to compute a point of the (pre)-kernel the emphasis of the chosen method lies not on efficiency and guessing good starting points but on computing large parts or in good cases the whole (pre)-kernel of a game. The chosen algorithm computes on a first step by relying on linear programming the n 2 largest amounts

Holger Meinhardt

Real-time Traffic

Bisection Property | COR 2006 | Final Linear | Linear Programming Problem |

claim paper

Related Content

» Load Balancing in Distributed Systems An Approach Using Cooperative Games

» Cooperative load balancing for a network of heterogeneous computers

» Direction Maps for Cooperative Pathfinding

» Cooperative PeertoPeer Streaming An Evolutionary GameTheoretic Approach

» Divisible Load Scheduling An Approach Using Coalitional Games

» Fast algorithms for finding randomized strategies in game trees

» A Cooperative Approach for Analyzing Intrusions in Mobile Ad hoc Networks

» A Proactive NonCooperative GameTheoretic Framework for Data Replication in Data Grids

» Transit Prices Negotiation Combined Repeated Game and Distributed Algorithmic Approach

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	COR
Authors	Holger Meinhardt

Comments (0)