Mathematical Game Theory and Applications

Provides introductory material to game theory, including bargaining, parlour games, sport, networking games and dynamic games -- Provided by publisher.

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Mazalov, Vladimir
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Newark : John Wiley & Sons, Incorporated, 2014.
Colección:New York Academy of Sciences Ser.
Temas:
Electronic books.
Acceso en línea:Texto completo
Tabla de Contenidos:
  • Intro
  • Mathematical Game Theory and Applications
  • Contents
  • Preface
  • Introduction
  • 1 Strategic-form two-player games
  • Introduction
  • 1.1 The Cournot duopoly
  • 1.2 Continuous improvement procedure
  • 1.3 The Bertrand duopoly
  • 1.4 The Hotelling duopoly
  • 1.5 The Hotelling duopoly in 2D space
  • 1.6 The Stackelberg duopoly
  • 1.7 Convex games
  • 1.8 Some examples of bimatrix games
  • 1.9 Randomization
  • 1.10 Games 2 x 2
  • 1.11 Games 2 x n and m x 2
  • 1.12 The Hotelling duopoly in 2D space with non-uniform distribution of buyers
  • 1.13 Location problem in 2D space
  • Exercises
  • 2 Zero-sum games
  • Introduction
  • 2.1 Minimax and maximin
  • 2.2 Randomization
  • 2.3 Games with discontinuous payoff functions
  • 2.4 Convex-concave and linear-convex games
  • 2.5 Convex games
  • 2.6 Arbitration procedures
  • 2.7 Two-point discrete arbitration procedures
  • 2.8 Three-point discrete arbitration procedures with interval constraint
  • 2.9 General discrete arbitration procedures
  • Exercises
  • 3 Non-cooperative strategic-form n-player games
  • Introduction
  • 3.1 Convex games. The Cournot oligopoly
  • 3.2 Polymatrix games
  • 3.3 Potential games
  • 3.4 Congestion games
  • 3.5 Player-specific congestion games
  • 3.6 Auctions
  • 3.7 Wars of attrition
  • 3.8 Duels, truels, and other shooting accuracy contests
  • 3.9 Prediction games
  • Exercises
  • 4 Extensive-form n-player games
  • Introduction
  • 4.1 Equilibrium in games with complete information
  • 4.2 Indifferent equilibrium
  • 4.3 Games with incomplete information
  • 4.4 Total memory games
  • Exercises
  • 5 Parlor games and sport games
  • Introduction
  • 5.1 Poker. A game-theoretic model
  • 5.1.1 Optimal strategies
  • 5.1.2 Some features of optimal behavior in poker
  • 5.2 The poker model with variable bets
  • 5.2.1 The poker model with two bets
  • 5.2.2 The poker model with n bets
  • 5.2.3 The asymptotic properties of strategies in the poker model with variable bets
  • 5.3 Preference. A game-theoretic model
  • 5.3.1 Strategies and payoff function
  • 5.3.2 Equilibrium in the case of
  • 5.3.3 Equilibrium in the case of
  • 5.3.4 Some features of optimal behavior in preference
  • 5.4 The preference model with cards play
  • 5.4.1 The preference model with simultaneous moves
  • 5.4.2 The preference model with sequential moves
  • 5.5 Twenty-one. A game-theoretic model
  • 5.5.1 Strategies and payoff functions
  • 5.6 Soccer. A game-theoretic model of resource allocation
  • Exercises
  • 6 Negotiation models
  • Introduction
  • 6.1 Models of resource allocation
  • 6.1.1 Cake cutting
  • 6.1.2 Principles of fair cake cutting
  • 6.1.3 Cake cutting with subjective estimates by players
  • 6.1.4 Fair equal negotiations
  • 6.1.5 Strategy-proofness
  • 6.1.6 Solution with the absence of envy
  • 6.1.7 Sequential negotiations
  • 6.2 Negotiations of time and place of a meeting
  • 6.2.1 Sequential negotiations of two players

Ejemplares similares