Tutor: LiXueLiang

School: Nankai University

Course: Applied Mathematics

Keywords: TU game covering value eiffciency Harsanyi dividend acyclic di?graph game dynamic Nash action theory

CLC: O157.5

Type: PhD thesis

Year: 2012

Downloads: 159

Quote: 0

Read: Download Dissertation

Game theory studys how the players act and how the fruits of their work areallocated. On the basis of whether cooperation is permitted among the players,games can be classified as cooperative and non-cooperative types. We study thegames with graph structures in cooperative and non-cooperative ways.We introduce a novel covering method to compute values for acyclic digraphgames, and we call the values obtained by this method the covering values. Thesevalues may be considered as natural extensions of the component eiffcient solu?tions for line-graph games studied by van den Brink et al.(Econ Theory33:349-364,2007), and the tree values studied by Khmelnitskaya (Theory Decis69(4):657-669,2010). With the new method, we reinterpret the tree values pro?posed by Khmelnitskaya in2010. Besides, we propose the covering values in thedigraph game with general acyclic digraph structures presenting lfow situationswhen some links may merge while others split into several separate ones. We giveaxiomatizations of these values, and interpret these values in terms of dividenddistributions.People are closely connected in learning, working and everyday life. Citiesare linked by more than one paths. When the connectivity of a graph increases,the structure of the graph becomes more stable. In our work, we modify the payofffunctions of BG-models proposed by Bala and Goyal (Econometria68(5):1181-1230,2000), such that agents benefit only when they are two way2-connected.We study the Nash, eiffcient and dynamic properties of two way2-connectedmodel, and compare it with BG-model. We ifnd that, most of the time, theempty graph, the cycle, and the centered graph are Nash networks. And the social implications of the empty graph and centered graph are discussed. Theoccurrence of an empty network is usually unexpected in a dynamic process, it cannot be stopped from happening by increasing the density of the initial network.The centered graph is kind of similar with the star structure in BG-model. |

- High Dynamic Carrier Tracking Algorithm of Software GNSS Receiver,P228.4
- Research on Control of Precision Centrifuge Dynamic Balance System,TH113.25
- Development of Turbine Rotor Dynamic Balance System,TH877
- Attitude Control Law Design Based on Blended Lateral Jets and Aerodynamic Control,V249.1
- Research on Cooperative Orbit Determination in Satellite Network Based on Multi-Agent System Theory,V474
- High Speed Aerodynamic Convection and Coupled Heat Transfer of Complicated Bodies,V215.4
- Study on the Locomotive Dynamic Supervision System,U284.48
- The Research on Artisitify Technology of Santiago·Calatrava’s Architectural Works,TU-86
- Study on the Improvement Depth of Dynamic Consolidation by Methods of Mathematical Physics,TU472.31
- Power System Dynamic Voltage Stability Simulation Study Based on Precise Integration Method,TM712
- Design and Implement of Multi-Port Network Communication Platform,TN929.5
- Research of Processor Performance Optimization Based on Function Dynamic Reuse,TP332
- Research on Parallel Frequent Graph Pattern Mining,TP311.13
- The Study of Text Index Construction for Large-Scale Dynamic Collection,TP391.3
- Research on Image Recognition Algorithm in the Forest Fire Prevention System,TP391.41
- Research on Navigation System Related Technology for Moving Objects under Dynamic Environment,TP301.6
- Research on Control Method of Moving-Mass and Lateral Thrust Combined Missile,TJ765
- Multi-Sensor Information Fusion and Its Applications on Wearable Computer,TP202
- The Relation between Fuzzy Logic Guidance Law and Homing Quality,TJ765
- The Study of Dynamic Simulation of the Passive Dynamic Quasi-Quarupedal Walker,TP242.6
- Analysis and Control of 6-DOF Electrical Driven Parallel Manipulator,TP242.2

CLC: > Mathematical sciences and chemical > Mathematics > Algebra,number theory, portfolio theory > Combinatorics ( combinatorics ) > Graph Theory

© 2012 www.DissertationTopic.Net Mobile