A New Approach to Meusnier s Theorem in Game Theory

Similar documents
Solutions of Stochastic Coalitional Games

Stochastic Coalitional Games with Constant Matrix of Transition Probabilities

A Structure of the Subgraph Induced at a Labeling of a Graph by the Subset of Vertices with an Interval Spectrum

The Number of Fuzzy Subgroups of Cuboid Group

Rainbow Vertex-Connection Number of 3-Connected Graph

A TRANSITION FROM TWO-PERSON ZERO-SUM GAMES TO COOPERATIVE GAMES WITH FUZZY PAYOFFS

Hyperbola for Curvilinear Interpolation

Deployment with Property Monodrome Group Topology

CAP 5993/CAP 4993 Game Theory. Instructor: Sam Ganzfried

A Game-Theoretic Framework for Congestion Control in General Topology Networks

Generating Topology on Graphs by. Operations on Graphs

Chapter 3. Quadric hypersurfaces. 3.1 Quadric hypersurfaces Denition.

Domination Number of Jump Graph

Disconnection Probability of Graph on Two Dimensional Manifold: Continuation

Some Algebraic (n, n)-secret Image Sharing Schemes

Ennumeration of the Number of Spanning Trees in the Lantern Maximal Planar Graph

Geometric approximation of curves and singularities of secant maps Ghosh, Sunayana

MAT175 Overview and Sample Problems

Graceful Labeling for Some Star Related Graphs

Connected Liar s Domination in Graphs: Complexity and Algorithm 1

Solution of m 3 or 3 n Rectangular Interval Games using Graphical Method

REVIEW I MATH 254 Calculus IV. Exam I (Friday, April 29) will cover sections

Application of Meta-Heuristic Interval Optimization Algorithms to Technical System Design Problems

Shape Control of Cubic H-Bézier Curve by Moving Control Point

Solution of Rectangular Interval Games Using Graphical Method

Soft Regular Generalized Closed Sets in Soft Topological Spaces

Chapter 15: Functions of Several Variables

Algorithmic Game Theory and Applications. Lecture 16: Selfish Network Routing, Congestion Games, and the Price of Anarchy

Algorithmic Game Theory and Applications. Lecture 16: Selfish Network Routing, Congestion Games, and the Price of Anarchy.

A solution for fuzzy game matrix using defuzzification method

Complete Bipartite Graphs with No Rainbow Paths

Lecture 6: Chain rule, Mean Value Theorem, Tangent Plane

Representation of Finite Games as Network Congestion Games

New perspectives on conic sections

On the Computational Complexity of Nash Equilibria for (0, 1) Bimatrix Games

Partition of a Nonempty Fuzzy Set in Nonempty Convex Fuzzy Subsets

1. A model for spherical/elliptic geometry

Solving a Two Dimensional Unsteady-State. Flow Problem by Meshless Method

Chapter 6. Curves and Surfaces. 6.1 Graphs as Surfaces

What is the Optimal Bin Size of a Histogram: An Informal Description

A Comparative Study on Optimization Techniques for Solving Multi-objective Geometric Programming Problems

Math 209, Fall 2009 Homework 3

Differential Geometry MAT WEEKLY PROGRAM 1-2

Review 1. Richard Koch. April 23, 2005

A New Approach to Evaluate Operations on Multi Granular Nano Topology

f xx (x, y) = 6 + 6x f xy (x, y) = 0 f yy (x, y) = y In general, the quantity that we re interested in is

New Classes of Closed Sets tgr-closed Sets and t gr-closed Sets

EC422 Mathematical Economics 2

Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives

REDUNDANCY OF MULTISET TOPOLOGICAL SPACES

Research Article The Relationship between Focal Surfaces and Surfaces at a Constant Distance from the Edge of Regression on a Surface

Using Ones Assignment Method and. Robust s Ranking Technique

Preliminary Mathematics of Geometric Modeling (3)

Computing Performance Measures of Fuzzy Non-Preemptive Priority Queues Using Robust Ranking Technique

Division of the Humanities and Social Sciences. Convex Analysis and Economic Theory Winter Separation theorems

Number Systems Based on Logical Calculus

05 - Surfaces. Acknowledgements: Olga Sorkine-Hornung. CSCI-GA Geometric Modeling - Daniele Panozzo

3. The three points (2, 4, 1), (1, 2, 2) and (5, 2, 2) determine a plane. Which of the following points is in that plane?

Enumeration of Minimal Control Sets of Vertices in Oriented Graph

Conditional Volatility Estimation by. Conditional Quantile Autoregression

Simple Channel-Change Games for Spectrum- Agile Wireless Networks

Vertex Graceful Labeling of C j C k C l

The Foundations of Geometry

Milby Mathew. Karpagam University Coimbatore-32, India. R. Parimelazhagan

Without fully opening the exam, check that you have pages 1 through 11.

Shape Modeling and Geometry Processing

Measuring Lengths The First Fundamental Form

Some New Generalized Nonlinear Integral Inequalities for Functions of Two Independent Variables

Extended Goursat s Hypergeometric Function

Sets of Endpoints of Chainable Continua

(Discrete) Differential Geometry

F A S C I C U L I M A T H E M A T I C I

Section Parametrized Surfaces and Surface Integrals. (I) Parametrizing Surfaces (II) Surface Area (III) Scalar Surface Integrals

ON THE GEODESIC TORSION OF A TANGENTIAL INTERSECTION CURVE OF TWO SURFACES IN R Introduction

12.6 Cylinders and Quadric Surfaces

Strategic Characterization of the Index of an Equilibrium. Arndt von Schemde. Bernhard von Stengel

Mathematically, the path or the trajectory of a particle moving in space in described by a function of time.

Spline Curves. Spline Curves. Prof. Dr. Hans Hagen Algorithmic Geometry WS 2013/2014 1

Building the Graphics Memory of. the Stiffness Matrix of the Beam

Dr. Allen Back. Aug. 27, 2014

Proximal Manifold Learning via Descriptive Neighbourhood Selection

Graph Sampling Approach for Reducing. Computational Complexity of. Large-Scale Social Network

Numerical Treatment of Geodesic Differential. Equations on a Surface in

Lecture-12: Closed Sets

Parametrization. Surface. Parametrization. Surface Integrals. Dr. Allen Back. Nov. 17, 2014

Rough Connected Topologized. Approximation Spaces

Algorithmic Game Theory - Introduction, Complexity, Nash

ON THE GEODESIC TORSION OF A TANGENTIAL INTERSECTION CURVE OF TWO SURFACES IN R Introduction

Best proximation of fuzzy real numbers

MATH 230 FALL 2004 FINAL EXAM DECEMBER 13, :20-2:10 PM

Interpretations and Models. Chapter Axiomatic Systems and Incidence Geometry

The Cover Pebbling Number of the Join of Some Graphs

Quadric Surfaces. Philippe B. Laval. Today KSU. Philippe B. Laval (KSU) Quadric Surfaces Today 1 / 24

ADDITION LAW ON ELLIPTIC CURVES

Kutztown University Kutztown, Pennsylvania. MAT 550: Foundations of Geometry

MATH 2400, Analytic Geometry and Calculus 3

Saturated Sets in Fuzzy Topological Spaces

MA 243 Calculus III Fall Assignment 1. Reading assignments are found in James Stewart s Calculus (Early Transcendentals)

Construction and smoothing of triangular Coons patches with geodesic boundary curves

volume & surface area of a right circular cone cut by a plane parallel to symmetrical axis (Hyperbolic section)

Transcription:

Applied Mathematical Sciences, Vol. 11, 2017, no. 64, 3163-3170 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.712352 A New Approach to Meusnier s Theorem in Game Theory Senay Baydas Yuzuncu Yil University Faculty of Science, Department of Mathematics, Van, Turkey Bulent Karakas Yuzuncu Yil University, Faculty of Economics and Administrative Science Department of Business Administration, Van, Turkey Copyright c 2017 Senay Baydas and Bulent Karakas. This article is distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract In this paper strategy sphere for the continuous games inspired by Meusnier s theorem is defined. Meusnier s sphere of a regular surface, an equilibrium point of a saddle surface and differential game theory are used for defining strategy sphere. Mathematics Subject Classification: 53A05, 53A04, 91A80 Keywords: Meusnier s sphere, saddle surface, strategy sphere 1 Introduction The mathematical theory of games was invented by John von Neumann and Oskar Morgenstern (1944) Theory of Games and Economic Behavior [10]. In 1950, JohnF. Nash Jr. wrote three papers Equilibrium Points in n- person games [7], The Bergaining problems [8] and Non-cooperative Games [9].

3164 Senay Baydas and Bulent Karakas Nash s Ph. D. Thesis Non-cooperative games, is one of the foundational paper of game theory. The concept of an equilibrium for non-cooperative games Nash Equilibrium is introduced. John Nash indicated that every game in which the set of actions available to each player is finite has at least one mixed-strategy equilibrium. In the literature, there are several books and papers about static noncooperative infinite games, dynamics game and nash and saddle-point equilibria of infinite dynamic games [1]. A continuous game has a surface for pay-off function. We can give a surface in R 3 with parametric curves. For example, let ϕ(u, v) be a topological surface in R 3 then ϕ(u 0, v) and ϕ(u, v 0 ) are the curves in ϕ(u, v) surface, where u 0 and v 0 are fixed values. Every parameter curve is a pure strategy for players. If payoff function of a game is P (u, v) then the surface form of the game is ϕ(u, v, P (u, v)). For every v = v 0 : fixed, the curves ϕ(u, v 0, P (u, v 0 )) are pure strategies of players, etc. The pure strategies curves, velocity, tangent and normal vectors, curvature can be studied in game theory. At this point Meusnier theorem and Meusnier sphere are important in game theory. We study in this article Meusnier theorem and Meusnier sphere for two person zero-sum differential games. 2 Meusnier s Theorem Meusnier s theorem states that all curves on a surface passing through a given point p and having the same tangent line at p also have the same normal curvature at p and their osculating circles form a sphere. The theorem was first announced by Jean Baptiste Meusnier in 1776 [5]. Let M be a regular surface in R 3, {α(s)} be a curve in M and k 1 (s) and k 2 (s) be curvatures of α(s). Suppose that α is not asymptotic in M, i.e., II(α (s), α (s)) =< α (s), α (s) > 0 where II is a second fundamental form of M. We know that d 2 α ds 2 = k 1 n k 1 n p, N p = α (s), N p

A new approach to Meusnier s theorem in game theory 3165 k 1 = α (s), N p n p, N p k 1 = II(α, α ) n, N In this study we assume that all curves we study are not asymptotic. If the surface normal N p and II second fundamental form is fixed at the point p α then the value of the curvature k 1 (s) is belong to n p. So we have All curves lying on a surface M and having the same tangent line at given point p M have the same normal curvature k 1 at this point. Let these curves be α i 1 i n. Then If φ = angle(n i, N p ) then we have dα i dt = t i = t. and (k i ) 1 = II( dα i ds, dα i ds ) cosϕ i (k i ) 1 cosϕ i = II( dα i ds, dα i ds ) Let β be intersecting curve of the plane sp{t, N p } and the surface M. We use n β, ϕ β and k 1β for the curve β. So we have k 1β = II( dα ds, dα ds ) p. It is clear that k 1 β = min{(k i ) 1 }. Then R β = max{ 1 (k i ) 1 = max{r i }

3166 Senay Baydas and Bulent Karakas and 1 R β = II(α, α ) i Theorem 2.1 Meusnier s Theorem Curvature circles of all curves lying a surface M E 3 and having the same tangent line at given point p in S 2 R (p + RN p ) [2, 5]. Definition 2.2 The sphere in Theorem 1 is called Meusnier s sphere [2]. 3 Game Theory-Continuous Games The second tool for this article is continuous games. Nash equilibrium is a main concept in the theory of games and the most widely used method of predicting the outcome of a strategic interaction in the social sciences. A game contains the following three elements: a set of players, a set of actions (or pure-strategies) available to each player, and a payoff (or utility) function for each player. The payoff functions represent each player s preferences over action profiles, where an action profile is simply a list of actions, each player. A pure-strategy is an action profile with the property that no single player can get a higher payoff by deviating unilaterally from this profile.the references of this section are [1, 3, 6, 7, 12]. Definition 3.1 The system Γ = (X, Y, K) where X and Y are nonempty sets and the function K : X Y R, is called a two person zero-sum game in normal form [6]. The elements x X and y Y are called strategies of players 1 and 2, respectively, in the game Γ, the elements of the cartesian product X Y, the function K is payoff of player 1. Players 2 s payoff in situation (x, y) is a set equal to K(x, y). Definition 3.2 Two-person zero-sum games in which both players have finite set of strategies are called matrix games [6]. Definition 3.3 Two-person zero-sum games in which both players have infinite set of strategies and K is continuous are called continuous games [6].

A new approach to Meusnier s theorem in game theory 3167 In the theory of games it is supposed that the behavior of both players is rational. Suppose player 1 chooses strategy x, then, at worst case he will win min y K(x, y). Therefore, player 1 can always guarantee himself the payoff max x min y K(x, y). ϑ = sup inf K(x, y) x X y Y is called the lower value of the game. For player 2 it is possible to provide similar reasonings. Suppose he chooses strategy y. Then, at worst, he will lose min x K(x, y). Therefore, the second player can always guarantee himself the payoff max y min x K(x, y). The number ϑ = inf sup y Y x X K(x, y) is called the upper value of the game Γ. In two-person zero-sum game Γ, ϑ ϑ. In the game Γ = (X, Y, K) it is natural to consider as optimal a situation (x, y ) X Y the deviation from which there is no advantage for both players. Such a point (x, y ) is called the equilibrium point and the optimality principle based on constructing an equilibrium point is called equilibrium principle. Definition 3.4 In the two-person zero-sum game Γ = (X, Y, K) the point (x, y ) is called an equilibrium point, or saddle point if for all x X and y Y. K(x, y ) K(x, y ) K(x, y) K(x, y ) In the matrix game Γ A the equilibrium points are the saddle points of the payoff matrix A, i.e. the point (i, j ) for which for all i M and j N the following inequalities are satisfied a ij a i j a i j. Definition 3.5 Let (x, y ) be a saddle point the game Γ. Then the number is called the value of the game ϑ. ϑ = K(x, y )

3168 Senay Baydas and Bulent Karakas Let D be a plane domain. Let ϕ be at least c 2 class function defined on Γ. The function ϕ then defines a curve T in (x, y, ϕ) space of which Γ is a simply covered projection. Such a curve is said to satisfy a three point condition with constant D provided that any plane which intersects it in three or more points has maximum inclination less than D. The concept of three point condition has been an essential feature in the theory of quasi-linear elliptic partial differential equations in two independent variables a(x, y, p, q)ϕ xx + 2b(x, y, p, q)ϕ xy + c(x, y, p, q)ϕ yy = 0 (1) p = ϕ x, q = ϕ y, ac b 2 = 1. To see the significance of this condition, we need only observe that if ϕ(x, y) is a solution of (1), then ϕ xx ϕ yy ϕ 2 xy = 1 a (aϕ xx + 2bϕ xy ϕ yy + cϕ 2 yy) 0. (2) Thus every solution of (1) represents a surface of non-positive Gaussnian curvature [4]. 4 Saddle Surfaces Let ϕ(x, y) be any two-variable function. Then (x 0, y 0 ) is a saddle point of φ if at the same time φ(x, y 0 ) assumes its maximum at x = x 0 and φ(x 0, y) assumes its minimum at y = y 0 [2, 11]. Definition 4.1 Let ϕ : D R 2 R 3 be a differentiable surface, if equation (2) is true at ϕ(x 0, y 0 ) then ϕ(x 0, y 0 ) is called a saddle point of surface ϕ [6,8]. Definition 4.2 A surface has at least one saddle point the surface is called saddle surface [2, 11]. For example, ϕ(u, v) = (u, v, u 2 v 2 ), ϕ(u, v) = (u, v, uv) are saddle surfaces with saddle point ϕ(0, 0). Also saddle surfaces are called hyperbolic paraboloid, because of parameter curve of a saddle surface being parabolas and hyperbolas. A saddle point of hyperbolic paraboloid (saddle surface) an important point, such that this point is minimum of maximum points of parabola and maximum of minimum points of hyperbolas.

A new approach to Meusnier s theorem in game theory 3169 5 Strategy Sphere Using Meusnier s theorem in game theory, we give a theorem as follows. Theorem 5.1 Let S be a saddle surface and {α i } S be all curves set on S, and P S be a saddle point. Let a relation be defined as α i α j α i and α j are passing from P. The relation is an equivalent relation on {α i }. Proof 5.2 It is obviously that, for i, j Reflexive properties: α i α i Symmetric property: α i α j α j α i Transitive property: α i α j and α j α k = α i α k are satisfied. Let G be a continuous game whose surface forms a saddle surface. Then {α i } equivalent class is the set of all strategies that have equilibrium point. Let A be a subset of {α i } which tangent vectors are same at equilibrium point. Then we can write Meusnier s theorem for these curves. Theorem 5.3 Let G be a continuous game whose surface forms a saddle surface. Then curvature circle of strategies has an equilibrium point and same tangent vector at equilibrium point in S 2 R (p + RN p). Definition 5.4 The sphere S 2 R (p + RN p) is called strategy sphere of the game G. For example, let ϕ(u, v) = (u, v, v 2 u 2 ) be surface of a continuous game G. Then for u = 0, v = 0, ϕ(0, 0) is a saddle point, i.e., equilibrium point. The normal surface is N = (0, 0, 1) at ϕ(0, 0) and R = 1. So, 2 S2 1 (0, 0, 1 ) is strategy 2 2 sphere of the game G. 6 Conclusion Meusnier s theorem is valid for c 2 class surface. A continuous game whose surface forms a saddle surface has an equilibrium point. In addition Meusnier s sphere as strategy sphere is defined. This is a new approach to Meusnier s theorem in game theory.

3170 Senay Baydas and Bulent Karakas References [1] T. Başar and G.J. Olsder, Dynamic Noncooperative Game Theory, Academic Press, New York, 1982. [2] M. Carmo, Differential Geometry of Curves and Surfaces, Prentice-Hall, New Jersey, 1976. [3] M. Dresher, Games of Strategy, Prentive-Hall, Inc., Englewood Cliffs, New Jersey, 1961. [4] R. Finn, On equation of minimal surface type, The Annals of Mathematics, 60 (1954), no. 3, 397-416. https://doi.org/10.2307/1969841 [5] J. B. Meusnier, Memoire sur la Courbure Des Surfaces (1776), Memoires de Mathematique et de Physique, Présentés a L Academie Royale des Sciences, par Divers Savans, et lus Dans ses Assemblées 10 (1785), 477-510. [6] P. Morris, Introduction to Game Theory, Springer-Verlag, 1994. https://doi.org/10.1007/978-1-4612-4316-8 [7] J. Nash, Equilibrium points in n-person games, Proceedings of the National Academy of Science, 36 (1950a), 48-49. https://doi.org/10.1073/pnas.36.1.48 [8] J. Nash, The Bargaining problem, Econometria, 18 (1950b), 155-162. https://doi.org/10.2307/1907266 [9] J. Nash, Non-cooperative games, The Annals of Mathematics, 54 (1951), 286-295. https://doi.org/10.2307/1969529 [10] J. Neumann and O. Morgenstern, Theory of Games and Economic Behavier, Princeton Universty Press, 1953. [11] V.A. Toponogov, Differential Geometry of Curves and Surfaces, Birkhauser, Boston, Springer, 2006. https://doi.org/10.1007/b137116 [12] J. Wang, The Theory of Games, Tsinghua University Press, 1988. Received: December 7, 2017; Published: December 29, 2017