Preface 1. Decision-Theoretic Foundations 1.1 Game Theory, Rationality, and Intelligence 1.2 Basic Concepts of Decision Theory 1.3 Axioms 1.4 The Expected-Utility Maximization Theorem 1.5 Equivalent Representations 1.6 Bayesian Conditional-Probability Systems 1.7 Limitations of the Bayesian Model 1.8 Domination 1.9 Proofs of the Domination Theorems Exercises 2. Basic Models 2.1 Games in Extensive Form 2.2 Strategic Form and the Normal Representation 2.3 Equivalence of Strategic-Form Games 2.4 Reduced Normal Representations 2.5 Elimination of Dominated Strategies 2.6 Multiagent Representations 2.7 Common Knowledge 2.8 Bayesian Games 2.9 Modeling Games with Incomplete Information Exercises 3. Equilibria of Strategic-Form Games 3.1 Domination and Ratonalizability 3.2 Nash Equilibrium 3.3 Computing Nash Equilibria 3.4 Significance of Nash Equilibria 3.5 The Focal-Point Effect 3.6 The Decision-Analytic Approach to Games 3.7 Evolution. Resistance. and Risk Dominance 3.8 Two-Person Zero-Sum Games 3.9 Bayesian Equilibria 3.10 Purification of Randomized Strategies in Equilibria 3.11 Auctions 3.12 Proof of Existence of Equilibrium 3.13 Infinite Strategy Sets Exercises 4. Sequential Equilibria of Extensive-Form Games 4.1 Mixed Strategies and Behavioral Strategies 4.2 Equilibria in Behavioral Strategies 4.3 Sequential Rationality at Information States with Positive Probability 4.4 Consistent Beliefs and Sequential Rationality at All Information States 4.5 Computing Sequential Equilibria 4.6 Subgame-Perfect Equilibria 4.7 Games with Perfect Information 4.8 Adding Chance Events with Small Probability 4.9 Forward Induction 4.10 Voting and Binary Agendas 4.11 Technical Proofs Exercises 5. Refinements of Equilibrium in Strategic Form 5.1 Introduction 5.2 Perfect Equilibria 5.3 Existence of Perfect and Sequential Equilibria 5.4 Proper Equilibria 5.5 Persistent Equilibria 5.6 Stable Sets 01 Equilibria 5.7 Generic Properties 5.8 Conclusions Exercises 6. Games with Communication 6.1 Contracts and Correlated Strategies 6.2 Correlated Equilibria 6.3 Bayesian Games with Communication 6.4 Bayesian Collective-Choice Problems and Bayesian Bargaining Problems 6.5 Trading Problems with Linear Utility 6.6 General Participation Constraints for Bayesian Games with Contracts 6.7 Sender-Receiver Games 6.8 Acceptable and Predominant Correlated Equilibria 6.9 Communication in Extensive-Form and Multistage Games Exercises Bibliographic Note 7. Repeated Games 7.1 The Repeated Prisoners Dilemma 7.2 A General Model of Repeated Garnet 7.3 Stationary Equilibria of Repeated Games with Complete State Information and Discounting 7.4 Repeated Games with Standard Information: Examples 7.5 General Feasibility Theorems for Standard Repeated Games 7.6 Finitely Repeated Games and the Role of Initial Doubt 7.7 Imperfect Observability of Moves 7.8 Repeated Wines in Large Decentralized Groups 7.9 Repeated Games with Incomplete Information 7.10 Continuous Time 7.11 Evolutionary Simulation of Repeated Games Exercises 8. Bargaining and Cooperation in Two-Person Games 8.1 Noncooperative Foundations of Cooperative Game Theory 8.2 Two-Person Bargaining Problems and the Nash Bargaining Solution 8.3 Interpersonal Comparisons of Weighted Utility 8.4 Transferable Utility 8.5 Rational Threats 8.6 Other Bargaining Solutions 8.7 An Alternating-Offer Bargaining Game 8.8 An Alternating-Offer Game with Incomplete Information 8.9 A Discrete Alternating-Offer Game 8.10 Renegotiation Exercises 9. Coalitions in Cooperative Games 9.1 Introduction to Coalitional Analysis 9.2 Characteristic Functions with Transferable Utility 9.3 The Core 9.4 The Shapkey Value 9.5 Values with Cooperation Structures 9.6 Other Solution Concepts 9.7 Colational Games with Nontransferable Utility 9.8 Cores without Transferable Utility 9.9 Values without Transferable Utility Exercises Bibliographic Note 10. Cooperation under Uncertainty 10.1 Introduction 10.2 Concepts of Efficiency 10.3 An Example 10.4 Ex Post Inefficiency and Subsequent Oilers 10.5 Computing Incentive-Efficient Mechanisms 10.6 Inscrutability and Durability 10.7 Mechanism Selection by an Informed Principal 10.8 Neutral Bargaining Solutions 10.9 Dynamic Matching Processes with Incomplete Information Exercises Bibliography Index

博弈论 : 矛盾冲突分析 = Game theory : analysis of conflict

https://www.isid.ac.in/~dmishra/pap_doc/network.pdf

A Strategic Model of Social and Economic Networks

In this Chapter, we imagine a decision maker (or a group of experts) trying to establish or examine fair procedures to combine opinions about alternatives related to different points of view.

Multiple criteria decision making

In network design, the gap between theory and practice is woefully broad. This book narrows it, comprehensively and critically examining current network design models and methods. You will learn where mathematical modeling and algorithmic optimization have been under-utilized. At the opposite extreme, you will learn where they tend to fail to contribute to the twin goals of network efficiency and cost-savings. Most of all, you will learn precisely how to tailor theoretical models to make them as useful as possible in practice. Throughout, the authors focus on the traffic demands encountered in the real world of network design. Their generic approach, however, allows problem formulations and solutions to be applied across the board to virtually any type of backbone communication or computer network. For beginners, this book is an excellent introduction. For seasoned professionals, it provides immediate solutions and a strong foundation for further advances in the use of mathematical modeling for network design. (Less)

Routing, Flow, And Capacity Design In Communication And Computer Networks

http://web.nchu.edu.tw/pweb/users/arborfish/lesson/8682.pdf

A survey of variants and extensions of the resource-constrained project scheduling problem

Problems of allocating joint costs in a reasonable way arise in many practical situations where people decide to work together to save costs. Cost allocation methods based on game theoretical concepts take into account the strategic aspects of cost allocation situations. We give a survey of cost allocation methods based on the nucleolus and the Shapley value, and introduce also a new one, the so-called cost gap allocation method which is based on the I-value. It is shown that for some large subclasses of cost allocation problems this new cost allocation method coincides with old separable cost methods proposed in the thirties by the Tennessee Valley Authority and also with the separable costs-remaining benefits SCRB method. Properties of this cost gap allocation method are also treated.

/pdf/game-theory-and-cost-allocation-problems-f4yhmy8mn5.pdf

Game theory and cost allocation problems

A new solution concept for communication situations is considered: the position value. This concept is based on an evaluation of the importance of the various communication links between the players. An axiomatic characterization of the position value is provided for the class of communication situations where the communication graphs contain no cycles. Furthermore, relations with the Myerson value are discussed,and, for special classes of communication situations, elegant calculation methods for their position values are described.

/pdf/on-the-position-value-for-communication-situations-4wj0qakcno.pdf

On the position value for communication situations

Bankruptcy problems are considered from a game theoretic point of view. Solution concepts from cooperative game theory are studied for bankruptcy games. A necessary and sufficient condition for a division rule for bankruptcy problems to be a game theoretic rule is given. A new division rule which is an adjustment of the proportional rule is given. This rule coincides with theT-value for bankruptcy games. Properties of the new rule are treated and a set of characterizing properties is given.

Bankruptcy games

Cooperative Games with Crisp Coalitions.- Preliminaries.- Cores and Related Solution Concepts.- The Shapley Value, the ?-value, and the Average Lexicographic Value.- Egalitarianism-based Solution Concepts.- Classes of Cooperative Crisp Games.- Cooperative Games with Fuzzy Coalitions.- Preliminaries.- Solution Concepts for Fuzzy Games.- Convex Fuzzy Games.- Fuzzy Clan Games.- Multi-Choice Games.- Preliminaries.- Solution Concepts for Multi-Choice Games.- Classes of Multi-Choice Games.

Models in Cooperative Game Theory

In this paper we study the endogenous formation of cooperation structures or communication graphs between players in a superadditive TU game. For each cooperation structure that is formed, the payoffs to the players are determined by an exogenously given solution. We model the process of cooperation structure formation as a game in strategic form. It is shown that several equilibrium refinements predict the formation of the complete cooperation structure or some structure which is payoff-equivalent to the complete structure. These results are obtained for a large class of solutions for cooperative games with cooperation structures. A by-product of our analysis is a characterization of the class of weighted Myerson values.

Stef Tijs

Papers

Game theory and cost allocation problems

On the position value for communication situations

Bankruptcy games

Models in Cooperative Game Theory

Link formation in cooperative situations