Dissertation > Excellent graduate degree dissertation topics show

Cooperation and non- cooperation of several repeat countermeasures solution algorithm

Author: ZhangLePing
Tutor: GaoHongWei
School: Qingdao University
Course: Applied Mathematics
Keywords: Repeat countermeasures Connected graph State payoff vector Absolutely balanced PMS value
CLC: O225
Type: Master's thesis
Year: 2008
Downloads: 14
Quote: 0
Read: Download Dissertation

Abstract


Types of countermeasures research with full information . In this paper, cooperation , partial cooperation , repeated in the case of full cooperation extended countermeasures optimal solution to commence the study . The subjects including the countermeasures tree repeat countermeasures repeat countermeasures on the state paid a connected graph . The first chapter of the main study measures tree repeat countermeasures to study the non-cooperative repeated countermeasures , at the same time we know that does not fully cooperate repeat Countermeasures process usually accompanied by changes in the structure of Union , some of the players are likely to leave for some reason on the stage of the Union to join the new alliance is more conducive to their own interests . This chapter gives a change coalition structure repeating extended countermeasures the PMS value of the complete algorithm as optimal criteria and to explore countermeasures in the process of optimal cooperation manner , and wish to explore the specific optimal criteria based on optimal the alliance formation followed the rules . Chapter II of this article by the introduction of the state in each state node connected graph payment vector , the study examined the dynamic finite graph repeat countermeasures . Use C.Berge about the concept of strategy on countermeasures , consider the case of non- cooperation , and prove that a connected graph with state payoff vector simple strategy significance on repeat countermeasures absolutely balanced existence theorem , given its complete algorithm as well as a three-dimensional connectivity grid map calculation example . Cooperation on this study on the basis of the second chapter finite graph with state payoff vector dynamic repeated countermeasures . Complete characteristic function in a simple strategic importance solving algorithm as well as a three-dimensional connectivity grid map calculation example . Explore three-dimensional connectivity grid map some of the basic properties of the countermeasures under certain conditions , and finally solving has to pay vector finite graph dynamic cooperation repeat countermeasures , given the example of a three-dimensional connectivity grid map calculation .

Related Dissertations

  1. Unique-Cycle Subgraphs in 2-Connected Graphs,O157.5
  2. Laplacian Matrix and Critical Group of a Graph,O157.5
  3. Removable Edges in 3-Connected Graphs,O157.5
  4. The Research on Clustering Routing Protocol Based on Connected Graph (CRPCG) in Wireless Sensor Network,TP212.9
  5. The High Order Restricted Edge-connectivity of Graphs,O157.5
  6. Number of cross- plot diagram and associated chart,O157.5
  7. The Structure of a Kind of Maximal Critically h_Connected Graphs,O157.5
  8. Research on Laplace Matrix and Potentially Nilpotent Sign Pattern,O157.5
  9. On the Extremal Problems for the General Randi(?) Index,O157.5
  10. Connected graph to the side and its algorithm analysis,TP301
  11. Removable Edges, Cycles and Connectivity in Graphs,O157.5
  12. Production of Maximal Plane Graphs and Chromatic Numbers of Some Special Graphs,O157.5
  13. Some Relationships among Parameters of K-domination in Graph,O157.5
  14. The Ordering of the Connected Graphs with the Smallest Laplacian Spectral Radii,O157.5
  15. Hamiltonian Colorings of Some Caterpillars,O157.5
  16. Connectivity of Graph and Extensibility of Path and Cycle of Graph,O157.5
  17. k k- connected graph contractible edge,O157.5
  18. Some of the results of the X - ring ( Road ),O157.5
  19. The Induced Matching Extendability of Graphs,O157.5
  20. Chromatic Equivalence and Uniqueness of Certain 2-Connected (n, n+2)-Graphs,O157.5

CLC: > Mathematical sciences and chemical > Mathematics > Operations Research > Game theory ( game theory )
© 2012 www.DissertationTopic.Net  Mobile