The present disclosure generally relates to blockchain technology. More particularly, the present disclosure relates to a system and a method for processing (recording and valuating) game-theoretic interactions using blockchain architecture.

BACKGROUND OF THE DISCLOSURE
[0002] The background description includes information that may be useful in understanding the present invention. It is not an admission that any of the information provided herein is prior art or relevant to the presently claimed invention, or that any publication specifically or implicitly referenced is prior art.
[0003] In general, due to the development of network technology in the past, most of the traditional digital games are stand-alone games, which refer to the use of a single game or computer to complete an independent operation of video games or computer games. Players in stand-alone games may only enjoy the fun of role-playing and game-playing, and cannot compete with other players, pass through, share secrets, exchange equipment or virtual game currency exchange. In recent years, with the development and progress of the internet, digital games may have also evolved from stand-alone games to online games. It means that through the Internet, multiple players can connect to each other to play interactive digital games to increase the fun of the game and richness. Online games may also offer a variety of games for large multiplayer online games, such as offering a variety of characters, offering rich battle modes, providing equipment or virtual game currency exchanges, and more. When a player wants to play online games, he must first register with his personal data to obtain a game account. In general, online games can provide the same internet protocol address (IP address) and multiple game accounts. The number of characters and the player to use the virtual game currency for exchange, the player can obtain the virtual game currency by successfully completing or completing the task, or purchase the virtual game token in real money, by using the virtual game coin in the corresponding online game. However, today's online games are rich in variety, and the same player may participate in a variety of online games at the same time. In order to, help players make the most effective use of game resources, a virtual game currency exchange platform may be provided to facilitate players to exchange different online games with other players. The virtual game currency exchange platform can provide multiple players according to the exchange preferences, and achieve an exchangeable consensus, that is, exchange actions, and the idle virtual game coins of each player flow to the use value other players, allowing other players to quickly get virtual game coins for other games.
[0004] Whether the virtual game currency exchange platform can provide players with secure exchange is important, including whether the exchange platform can help verify the authenticity, accuracy and legitimacy of the virtual game currency. Whether there is a relative solution to the pipeline if there are doubts or disputes. How to provide a safe and secure virtual game currency exchange platform, for any player exchanged, will affect the security and exchange willingness of its operations. Further, strategic interactions between competitive agents may be ideally modelled using non-cooperative game theory, where each agent may have an associated payoff consequent to / resulting from the joint action profile corresponding to all participant agents in the game. Optimal best response actions of the involved agents may be defined and computed under some equilibrium condition on the announced game, such as for example, a Nash equilibrium. Under the assumption of rationality, although a given agent is only in-charge of its own action, the agent may assume that its counterparts would act under the established equilibrium, which may maximize the payoff of all agents at the same time. The aforementioned game theoretic interactions may not have a formal distributed protocol to record each agent actions and the consequential payoff in a distributed ledger. Further, blockchain consensus protocols for cryptocurrencies and specialized usage of distributed consensus for multiple applications, such as energy markets, healthcare, supply chain, Artificial Intelligence (AI), and the like may already exist. The realization of game theoretic interactions for strategic decision making may be presently seen in isolation from/without the use of distributed consensus protocols. Further, in game theory and blockchains there may be able to deploy games on top of an arbitrary blockchain. However, a naive implementation of games using blockchains may be susceptible to an attack. For example, consider two players i1; i2 choosing actions a1; a2 respectively for some round of the game. If i2 sees the action a1 by i1 as a blockchain transaction before the transaction is finalized (for instance, a transaction in the bitcoin's proof-of-work protocol is finalized once it is six blocks deep), then i2 can change its action to for a higher payoff, thereby leading to fraud game. Transaction maturity in traditional blockchains may have simple technical rules: once the transaction from party-A and party-B, for say T digital tokens, is finalized (for instance, in Bitcoin, when the said transaction is six blocks deep), the digital tokens are transferred from party-A to party-B. Most blockchain based cryptocurrencies may have static rules. For example, in bitcoin, transactions are finalized when they are six blocks deep, and coin base transactions are executed after the confirmation of 100 blocks. Unfortunately, these rules are hard-coded and static.
[0005] Hence, there is a need in the state of the art to provide the systems and methods which solves the aforementioned problems.

OBJECTS OF THE INVENTION
[0006] Some of the objects of the present disclosure, which at least one embodiment herein satisfies, are as listed herein below.
[0007] An object of present disclosure is to provide an efficient and secure system and method for processing game-theoretic interactions using blockchain architecture.
[0008] Another object of present disclosure is to provide system and method for recording and valuation of game theoretic interactions using blockchain consensus protocols.
[0009] Another object of present disclosure is to provide system and method for realizing single game by revealing actions after block confirmation in the blockchain network.
[00010] Another object of present disclosure is to provide system and method for eliminating multiple actions in an execution, or game updates, by timestamping.
[00011] Another object of present disclosure is to provide system and method for fast confirmation of game execution / update through constant time blockchain consensus protocols.
[00012] An object of present disclosure is to provide system and method for eliminating fraud from participant players, by using secure protocol game coin.
[00013] Another object of present disclosure is to formalize game theoretic interactions, and serve as a decentralized system for organizations to define and deploy arbitrary games of player’s interest.

SUMMARY
[00014] The present disclosure relates to a game theoretic system for processing game-theoretic interactions using blockchain architecture. The game theoretic system receives, in response to initiation of an event, from each of a plurality of participating entities, at least one action from a defined set of possible actions. Further, the game theoretic system transforms, for each of the plurality of participating entities, the at least one received action into a unique identifier, and place said unique identifier onto a blockchain in a manner such that the action selected by the respective participating entity is positioned on the blockchain in the form of the corresponding unique identifier, but said action is hidden from the other entities until completion of the event. Upon placement of all unique identifiers of the participating entities onto a block of the blockchain, the game theoretic system executes a blockchain consensus protocol to confirm that the block is added to the blockchain, wherein each entity announces having undertaken its respective action post-placement of the corresponding unique identifier onto the blockchain. Based on determination of outcome of the event upon its completion, the game theoretic system allocates a value to at least one of said plurality of participating entities, said outcome determination being made based on one or more rules associated with the event.
[00015] In an aspect, the genesis block of the blockchain comprises the one or more rules associated with the event.
[00016] In an aspect, a block following the genesis block of the blockchain comprises updates to the one or more rules stored in the genesis block.
[00017] In another aspect, the transformation is undertaken through a combination of a cryptographic hash function and a signature scheme.
[00018] In another aspect, the transformation is undertaken through a collision resistant transformation function.
[00019] In yet another aspect, the unique identifier is obtained based on processing of a time secret random string with the action selected by the respective entity.
[00020] In another aspect, the entity announces having undertaken its respective action by means of a signed message that maps to the unique identifier.
[00021] In an aspect, the unique identifiers of all participating entities are collected and placed onto payload of the blockchain together.
[00022] In another aspect, upon placement of a selected action by respective entity on the blockchain, said respective entity is not allowed to modify the blockchain-placed action.
[00023] In another aspect, the event comprises one or more rounds such that the plurality of participating entities selects actions from the defined set of possible actions in each of the one or more rounds.
[00024] Further, present disclosure provides a method for processing game-theoretic interactions using blockchain architecture. The method includes receiving, in response to initiation of an event, from each of a plurality of participating entities, at least one action from a defined set of possible actions. Further, the method includes transforming, for each of the plurality of participating entities, the at least one received action into a unique identifier, and place said unique identifier onto a blockchain in a manner such that the action selected by the respective participating entity is positioned on the blockchain in the form of the corresponding unique identifier, but said action is hidden from the other entities until completion of the event. Upon placement of all unique identifiers of the participating entities onto a block of the blockchain, the method includes executes a blockchain consensus protocol to confirm that the block is added to the blockchain, wherein each entity announces having undertaken its respective action post-placement of the corresponding unique identifier onto the blockchain. Based on determination of outcome of the event upon its completion, the methods include allocating a value to at least one of said plurality of participating entities, said outcome determination being made based on one or more rules associated with the event.
[00025] Various objects, features, aspects and advantages of the present disclosure will become more apparent from the following detailed description of preferred embodiments, along with the accompanying drawing figures in which like numerals represent like features.
[00026] Within the scope of this application, it is expressly envisaged that the various aspects, embodiments, examples and alternatives set out in the preceding paragraphs, in the claims and/or in the following description and drawings, and in particular the individual features thereof, may be taken independently or in any combination. Features described in connection with one embodiment are applicable to all embodiments, unless such features are incompatible.

BRIEF DESCRIPTION OF DRAWINGS
[00027] The accompanying drawings are included to provide a further understanding of the present disclosure, and are incorporated in and constitute a part of this specification. The drawings illustrate exemplary embodiments of the present disclosure and, together with the description, serve to explain the principles of the present disclosure. The diagrams are for illustration only, which thus is not a limitation of the present disclosure, and wherein:
[00028] FIG. 1 illustrates an exemplary block diagram representation of network architecture in which or with which proposed game theoretic system of the present disclosure can be implemented, in accordance with an embodiment of the present disclosure;
[00029] FIG. 2A illustrates a detailed block diagram representation of game theoretic system for processing game-theoretic interactions using blockchain architecture, in accordance with an embodiment of the present disclosure;
[00030] FIG. 2B illustrates a schematic representation of winning rules in an exemplary game, in accordance with an embodiment of the present disclosure;
[00031] FIG. 3 illustrates a flow chart depicting a method for processing game-theoretic interactions using blockchain architecture, in accordance with an embodiment of the present disclosure; and
[00032] FIG. 4 illustrates an exemplary computer system in which or with which embodiments of the present invention can be utilized, in accordance with embodiments of the present disclosure.

DETAILED DESCRIPTION
[00033] The following is a detailed description of embodiments of the disclosure depicted in the accompanying drawings. The embodiments are in such detail as to clearly communicate the disclosure. However, the amount of detail offered is not intended to limit the anticipated variations of embodiments; on the contrary, the intention is to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the present disclosure as defined by the appended claims.
[00034] In the following description, numerous specific details are set forth in order to provide a thorough understanding of embodiments of the present invention. It will be apparent to one skilled in the art that embodiments of the present invention may be practiced without some of these specific details.
[00035] If the specification states a component or feature “may”, “can”, “could”, or “might” be included or have a characteristic, that particular component or feature is not required to be included or have the characteristic.
[00036] As used in the description herein and throughout the claims that follow, the meaning of “a,” “an,” and “the” includes plural reference unless the context clearly dictates otherwise. Also, as used in the description herein, the meaning of “in” includes “in” and “on” unless the context clearly dictates otherwise.
[00037] Exemplary embodiments will now be described more fully hereinafter with reference to the accompanying drawings, in which exemplary embodiments are shown. These exemplary embodiments are provided only for illustrative purposes and so that this disclosure will be thorough and complete and will fully convey the scope of the invention to those of ordinary skill in the art. The invention disclosed may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Various modifications will be readily apparent to persons skilled in the art. The general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the invention. Moreover, all statements herein reciting embodiments of the invention, as well as specific examples thereof, are intended to encompass both structural and functional equivalents thereof. Additionally, it is intended that such equivalents include both currently known equivalents as well as equivalents developed in the future (i.e., any elements developed that perform the same function, regardless of structure). Also, the terminology and phraseology used is for the purpose of describing exemplary embodiments and should not be considered limiting. Thus, the present invention is to be accorded the widest scope encompassing numerous alternatives, modifications and equivalents consistent with the principles and features disclosed. For purpose of clarity, details relating to technical material that is known in the technical fields related to the invention have not been described in detail so as not to unnecessarily obscure the present invention.
[00038] Thus, for example, it will be appreciated by those of ordinary skill in the art that the diagrams, schematics, illustrations, and the like represent conceptual views or processes illustrating systems and methods embodying this invention. The functions of the various elements shown in the figures may be provided through the use of dedicated hardware as well as hardware capable of executing associated software. Similarly, any switches shown in the figures are conceptual only. Their function may be carried out through the operation of program logic, through dedicated logic, through the interaction of program control and dedicated logic, or even manually, the particular technique being selectable by the entity implementing this invention. Those of ordinary skill in the art further understand that the exemplary hardware, software, processes, methods, and/or operating systems described herein are for illustrative purposes and, thus, are not intended to be limited to any particular named element.
[00039] The ensuing description provides exemplary embodiments only, and is not intended to limit the scope, applicability, or configuration of the disclosure. Rather, the ensuing description of the exemplary embodiments will provide those skilled in the art with an enabling description for implementing an exemplary embodiment. It should be understood that various changes may be made in the function and arrangement of elements without departing from the spirit and scope of the disclosure as set forth in the appended claims.
[00040] Specific details are given in the following description to provide a thorough understanding of the embodiments. However, it will be understood by one of ordinary skill in the art that the embodiments may be practiced without these specific details. For example, circuits, systems, networks, processes, and other components may be shown as components in block diagram form in order not to obscure the embodiments in unnecessary detail. In other instances, well-known circuits, processes, algorithms, structures, and techniques may be shown without unnecessary detail in order to avoid obscuring the embodiments.
[00041] Each of the appended claims defines a separate invention, which for infringement purposes is recognized as including equivalents to the various elements or limitations specified in the claims. Depending on the context, all references below to the "invention" may in some cases refer to certain specific embodiments only. In other cases, it will be recognized that references to the "invention" will refer to subject matter recited in one or more, but not necessarily all, of the claims.
[00042] All methods described herein can be performed in any suitable order unless otherwise indicated herein or otherwise clearly contradicted by context. The use of any and all examples, or exemplary language (e.g., “such as”) provided with respect to certain embodiments herein is intended merely to better illuminate the invention and does not pose a limitation on the scope of the invention otherwise claimed. No language in the specification should be construed as indicating any non-claimed element essential to the practice of the invention.
[00043] Various terms as used herein are shown below. To the extent a term used in a claim is not defined below, it should be given the broadest definition persons in the pertinent art have given that term as reflected in printed publications and issued patents at the time of filing.
[00044] Embodiments herein provide efficient and secure system and method for processing game-theoretic interactions using blockchain architecture. Embodiments herein provide system and method for recording and valuation of game theoretic interactions using blockchain consensus protocols. Embodiments herein provide system and method for realizing single game by revealing actions after block confirmation in the blockchain network. Embodiments herein provide system and method for eliminating multiple actions in an execution, or game updates, by timestamping. Embodiments herein provide system and method for fast confirmation of game execution / update through constant time blockchain consensus protocols. Embodiments herein provide system and method for eliminating fraud from participant players, by using secure protocol game coin. Embodiments herein formalize game theoretic interactions, and serve as a decentralized system for organizations to define and deploy arbitrary games of player’s interest.
[00045] Referring to FIG. 1 illustrating an exemplary block diagram representation of network architecture for recording and valuation of game-theoretic interactions system 100 (also referred to as network architecture 100) in which or with which a proposed game theoretic system 110 of the present disclosure can be implemented, in accordance with an embodiment of the present disclosure. As illustrated, the exemplary network architecture 100 may be equipped with the game theoretic system 110 for facilitating processing of game-theoretic interactions using a blockchain network 112 to entities 102-1, 102-2, 102-3,…, 102-N (individually referred to as the entity 102 and collectively referred to as the entities 102) associated with one or more first computing devices 104-1, 104-2,…, 104-N (individually referred to as the first computing device 104 and collectively referred to as the first computing devices 104). The entities 102 may be at least one of, but not limited to, players, spectators, basic users, premium users, amateur players, professional players, buyers or seller, based on the game/transaction, and the like. A plurality of community servers (not shown in FIG. 1) may be provided to facilitate interaction via gaming platform (not shown in FIG. 1) between multiple entities 102. The gaming platform associated with the game theoretic system 110 may be logically connected directly or indirectly via networking means to a blockchain network 112. While a single blockchain network is shown in FIG. 1, it is understood that multiple blockchain networks may be utilized to conduct transactions of the underlying blockchain and cryptocurrency capabilities described herein. One or more entities 102 may place bets or wagers for games, esports, matches, provided by the gaming platform associated with the game theoretic system 110. Entities 102 may be provided with the ability to play for crypto-currency/game coin in competitive skill-based video game matches/games hosted by the gaming platform via community servers. Rewards/game coins may be provided via the platform's API (not shown in FIG. 1). Further applications may include a next-generation spectator engagement application. Gaming Platform may also provide access to premium subscription features such as rewards for performing various actions on the platform (e.g., connecting your gamer accounts, referring new customers, and access to premium written and video content). The game theoretic system 110 may be communicatively and/or operatively coupled to the first computing devices 104. In an embodiment, the game theoretic system 110 may be associated with the first computing devices 104. In an embodiment, the first computing devices 104 may be used for transacting on the blockchain network 112.
[00046] In an embodiment, the game theoretic system 110 may be communicatively and/or operatively coupled to one or more second computing devices 108-1, 108-2, …, 108-N (individually referred to as the second computing device 108 and collectively referred to as the second computing devices 108). The game theoretic system 110 may also be associated with the second computing device 108. The second computing device 108 may be associated with at least one of, but not limited to, a company, an organization, a university, a lab facility, a business enterprise, a firm, a bank, a consumer, a merchant, an investor, a store, a game facility, a gaming zone, or any other secured facility, players, spectators, basic users, premium users, amateur players, professional players, buyers or seller, based on the game/transaction, and the like. In an embodiment, the second computing devices 108 may be used for updating the transaction on the blockchain network 112. In an embodiment, the one or more first computing devices 104, and the one or more second computing devices 108 may communicate with the game theoretic system 110 via set of executable instructions residing on any operating system. In an embodiment, one or more first computing devices 104, and the one or more second computing devices 108 may include, but not limited to, any electrical, electronic, electro-mechanical or an equipment or a combination of one or more of the above devices such as mobile phones, smartphones, Virtual Reality (VR) devices, Augmented Reality (AR) devices, laptops, a general-purpose computers, desktops, personal digital assistants, tablet computers, mainframe computers, or any other computing devices, wherein the computing device may include one or more in-built or externally coupled accessories including, but not limited to, a visual aid device such as camera, audio aid, a microphone, a keyboard, input devices for receiving input from a user such as touch pad, touch enabled screen, electronic pen, receiving devices for receiving any audio or visual signal in any range of frequencies and transmitting devices that can transmit any audio or visual signal in any range of frequencies. It may be appreciated that, the to one or more first computing devices 104, and the one or more second computing devices 108 may not be restricted to the mentioned devices and various other devices may be used. A smart computing device may be one of the appropriate systems for storing data and other private/sensitive information. In an embodiment, processes of one or more first computing devices 104, and processes of the one or more second computing devices 108 may be implemented in one/same computing device.
[00047] In an embodiment, the game theoretic system 110 may also be communicatively coupled to the one or more first computing devices 104 via a communication network 106. In some embodiments, the game theoretic system 110 may be implemented using an electronic device such as, but not limited to, a mobile, a smart phone, a tablet, a phablet, a personal digital assistant, a computer, a laptop, a server, and the like. Such server may include or comprise, by way of example, but not limited to, one or more of a stand-alone server, a server blade, a server rack, a bank of servers, a server farm, hardware supporting a part of a cloud service or system, a home server, hardware running a virtualized server, one or more processors executing code to function as a server, one or more machines performing server-side functionality as described herein, at least a portion of any of the above, some combination thereof. In an embodiment, the game theoretic system 110 may be a System on Chip (SoC) system but not limited to the like. In another embodiment, an onsite data capture, storage, matching, processing, decision-making and actuation logic may be coded using Micro-Services Architecture (MSA) but not limited to it. A plurality of microservices may be containerized and may be event based in order to support portability. In an embodiment, the network architecture 100 may be modular and flexible to accommodate any kind of changes in the game theoretic system 110 as proximate processing may be acquired towards re-estimating of stock. The game theoretic system 110 configuration details can be modified on the fly. In an embodiment, the game theoretic system 110 may be remotely monitored and the data, application and physical security of the game theoretic system 110 may be fully ensured. In an embodiment, the data may get collected meticulously and deposited in a cloud-based data lake to be processed to extract actionable insights. Therefore, the aspect of predictive maintenance can be accomplished. In an exemplary embodiment, the communication network 106 may include, by way of example but not limitation, at least a portion of one or more networks having one or more nodes that transmit, receive, forward, generate, buffer, store, route, switch, process, or a combination thereof, etc. one or more messages, packets, signals, waves, voltage or current levels, some combination thereof, or so forth. A network may include, by way of example but not limitation, one or more of: a wireless network, a wired network, an internet, an intranet, a public network, a private network, a packet-switched network, a circuit-switched network, an ad hoc network, an infrastructure network, a Public-Switched Telephone Network (PSTN), a cable network, a cellular network, a satellite network, a fiber optic network, some combination thereof.
[00048] In an embodiment, the game theoretic system 110 may be coupled to the block chain network 112 (interchangeably referred as blockchain 112 or blockchain architecture 112 or blockchain network 112). The block chain network 112 may also be operatively coupled to the one or more first computing devices 104 and the second computing devices 108 through the communication network 106. As illustrated in FIG. 1, the blockchain network 112 is an illustrative example in accordance with at least one embodiment of the present disclosure. The blockchain network 112 illustrates a simplified blockchain having blocks. The blocks may include a genesis block. Each block may include certain information, such as an identification, or hash, that uniquely identifies the block, a timeline identifying previous blocks (e.g., the hash numbers of previous blocks) in chronological order, transactions to record all transfers between a sender and a receiver, and a public key that identifies at least one sender and at least one receiver. The linked blocks therefore form a chain where each link, or block, in the chain uniquely identifies a previous link, or block, by including the hash or the prior link, or block. The blockchain network 112, may be a distributed ledger, or blockchain may be distributed, or replicated, on a network. The distributed ledger may be replicated and maintained on a database within the underlying blockchain network 112. Further, a distributed secure transaction ledger, in the form of the blockchain network 112, may be used to communicate data between entities 102. The blockchain network 112 (or decentralized secure transaction ledger) may be one that is maintained by nodes in a distributed network. Although each block of blockchain network 112 / ledger may include differentiated information and may have distinct purposes, each block may include a sample communication or message.
[00049] The blockchain network 112 may be used to send messages, or conduct transactions, between at least two entities 112 through, for example, nodes in a network. By way of non-limiting example, a message in block of the blockchain network 112 may include a header and contents, and the like. The header may include at least one block ID for block, a nonce value, an arbitrary number that may be used as a cryptographic hash function. These values and block information may be used in linking blocks together to form a chain.
[00050] In an embodiment, the game theoretic system 110 may receive, in response to initiation of an event, from each of a plurality of participating entities 102, at least one action from a defined set of possible actions. The event may include, but not limited to, one or more rounds such that the plurality of participating entities 102 select actions from the defined set of possible actions in each of the one or more rounds, and the like. In an embodiment, the game theoretic system 110 may transform, for each of the plurality of participating entities 102, the at least one received action into a unique identifier, and place said unique identifier onto the blockchain network 112 in a manner such that the action selected by the respective participating entity is positioned on the blockchain network 112 in the form of the corresponding unique identifier, but said action is hidden from the other entities until completion of the event. Upon placement of a selected action by respective entity 102 on the blockchain network 112, the respective entity may not be allowed to modify the blockchain-placed action.
[00051] In an embodiment, the transformation may be undertaken through a combination of a cryptographic hash function and a signature scheme. The transformation is undertaken through a collision resistant transformation function. The unique identifier may be obtained based on processing of a time secret random string with the action selected by the respective entity. In an embodiment, the unique identifiers of all participating entities 102 may be collected and placed onto a payload of the blockchain network 112 together.
[00052] Upon placement of all unique identifiers of the participating entities onto a block of the blockchain network 112, the game theoretic system 110 may execute a blockchain consensus protocol to confirm that the block is added to the blockchain network 112. Each entity 102 may announce having undertaken its respective action post-placement of the corresponding unique identifier onto the blockchain network 112. The entity 102 may announce having undertaken its respective action by means of a signed message that maps to the unique identifier. Based on determination of outcome of the event upon its completion, the game theoretic system 110 may allocate a value to at least one of said plurality of participating entities 102, the outcome determination being made based on one or more rules associated with the event. In an embodiment, the genesis block of the blockchain network 112 may include the one or more rules associated with the event. Further, the block following the genesis block of the blockchain may include updates to the one or more rules stored in the genesis block.
[00053] FIG. 2A illustrates a detailed block diagram representation of the game theoretic system 110 for processing game-theoretic interactions using blockchain architecture, in accordance with an embodiment of the present disclosure.
[00054] The game theoretic system 110 may include a processor 202, an Input/Output (I/O) interface 202 and a memory 206. In some implementations, the game theoretic system 110 may include data 208 and modules 210. As an example, the data 208 is stored in the memory 206 configured in the game theoretic system 110 as shown in the FIG. 2A. In one embodiment, the data 208 may include event data 212, entity data 214, action data 216, transformation data 218, identifier data 220, block data 222, announcement data 224, outcome data 226, value allocation data 228, rules data 230, and other data 232.
[00055] In an embodiment, the data 208 may be stored in the memory 206 in the form of various data structures. Additionally, the data 208 can be organized using data models, such as relational or hierarchical data models. The other data 232 may store data, including temporary data and temporary files, generated by the modules 210 for performing the various functions of the game theoretic system 110.
[00056] In an embodiment, the data 208 stored in the memory 206 may be processed by the modules 210 of the game theoretic system 110. The modules 210 may be stored within the memory 206. In an example, the modules 206 communicatively coupled to a processor 202 configured in the game theoretic system 104, may also be present outside the memory 206 as shown in FIG. 2A and implemented as hardware. As used herein, the term modules refer to an application-specific integrated circuit (ASIC), an electronic circuit, a processor (shared, dedicated, or group) and memory that execute one or more software or firmware programs, a combinational logic circuit, and/or other suitable components that provide the described functionality.
[00057] In an embodiment, the modules 210 may include, for example, a receiving module 242, a transforming module 244, an executing module 246, an allocating determining module 248, and other modules 250. The other modules 250 may be used to perform various miscellaneous functionalities of the game theoretic system 110. It will be appreciated that such aforementioned modules 214 may be represented as a single module or a combination of different modules.
[00058] In an embodiment, the receiving module 242 may receive, in response to initiation of an event, from each of a plurality of participating entities 102, at least one action from a defined set of possible actions. The event may include, but not limited to, one or more rounds such that the plurality of participating entities 102 select actions from the defined set of possible actions in each of the one or more rounds, and the like. The initiation of an event may be stored as the event data 212. The participating entities 102 may be stored as the entity data 214. The at least one action may be stored as the action data 216.
[00059] In an embodiment, the transforming module 244 may transform, for each of the plurality of participating entities 102, the at least one received action into a unique identifier, and place said unique identifier onto the blockchain network 112 in a manner such that the action selected by the respective participating entity is positioned on the blockchain network 112 in the form of the corresponding unique identifier, but said action is hidden from the other entities until completion of the event. Upon placement of a selected action by respective entity 102 on the blockchain network 112, the respective entity may not be allowed to modify the blockchain-placed action. The transformation of the at least one received action is stored as the transformation data 218. The unique identifier is stored as the identifier data 220. In an embodiment, the transformation may be undertaken through a combination of a cryptographic hash function and a signature scheme. The transformation is undertaken through a collision resistant transformation function. The unique identifier may be obtained based on processing of a time secret random string with the action selected by the respective entity. In an embodiment, the unique identifiers of all participating entities 102 may be collected and placed onto a payload of the blockchain network 112 together.
[00060] For instance, consider a set of entities 102 such as agents/players/users is given by [n]: = {1, 2, …., n}. For brevity, consider denoting a split of a vector “V” on an index “i” as V = (vi, V-i) while implicitly preserving the order of elements. The “-i” may denote all indices in [n] except “i”. Further, associated with each player i ? [n] may be a digital identity consisting of a private signing key “ski” and a public verification key “vki” under the signature scheme S = (dsig, dver). Assuming the availability of an ideal collision resistant hash function (CRHF) H. “H” may be used to commit the actions of each entity 102 during a game execution on the game platform of the game theoretic system 110. The availability of permissionless blockchain consensus protocols such as Bitcoin or Algorand may also be assumed to commit the actions of each entity 102 during a game execution on the game platform of the game theoretic system 110.
[00061] Upon placement of all unique identifiers of the participating entities onto a block of the blockchain network 112, the executing module 246 may execute a blockchain consensus protocol to confirm that the block is added to the blockchain network 112. The block may be stored as the block data 222. Each entity 102 may announce having undertaken its respective action post-placement of the corresponding unique identifier onto the blockchain network 112. The announcement of undertaken respective action post-placement may be stored as announcement data 224. The entity 102 may announce having undertaken its respective action by means of a signed message that maps to the unique identifier. Based on determination of outcome of the event upon its completion, the allocating determining module 248 may allocate a value to at least one of said plurality of participating entities 102, the outcome determination being made based on one or more rules associated with the event. The outcome may be stored as the outcome data 226. The allocation of a value to at least one of said plurality of participating entities 102 may be stores as the value allocation data 228. The one or more rules associated with the event may be stored as the rules data 230. In an embodiment, the genesis block of the blockchain network 112 may include the one or more rules associated with the event. Further, the block following the genesis block of the blockchain may include updates to the one or more rules stored in the genesis block.
[00062] For instance, consider a non-cooperative, repeated game. Firstly, a game “G” under Game Coin, may be a repeated game given by a tuple “G” as in equation 1 below:
G = ([n], {Ai}i?[n], {ui}i? [n]) …. Equation 1
[00063] In the above equation 1, the term “[n]” may refer to set of entities 102 (i.e., players), ?i ?[n], the term “Ai” may refer to the set of actions available to entities 102 “i”. Also, A: = Xi? [n] Ai may refer to the set of all action profiles. Further, each entity 102 i?[n] may have a payoff function ui: A? R.
[00064] The entities 102 may collectively agree on the strategic form game: G = ([n], {Ai}i? [n], {ui}i? [n]) which may be the ‘public image’ of the competition recorded on the blockchain network 112 as part of the Game Coin protocol.
[00065] Secondly, given a strategy universe “?”, a payoff “f”, and a complementary strategy profile “t”, the best response set may be based on the equation 2 below:
BRf (t): = {w?? :?w’? ?, f (w, t) ? f (w’, t)} …. Equation 2
[00066] Thirdly, given the ‘public image’ of the game ‘G’, the best response profiles may be based on the equation 3 below:
BR(G): = {a?A: ?i?[n], ai?BRui (a-i)} …. Equation 3
[00067] The best response set BR(G) in the above equation 3 may also called the Nash Equilibrium. Assume that a repeated game in normal form that is being recorded under Game Coin has a Nash equilibrium which may be efficiently computable.
[00068] The blockchain consensus may be required to record the game theoretic interactions. Fourthly, in every epoch “e” of consensus, ?i?[n], entities 102 “i”, may prepare a block of a list of transactions. In every epoch “e”, there may exist a leader player such as the entity 102 le?[n] elected as a consequence of a blockchain consensus protocol, such that all entities 102 in [n] agree on the block := Also, there may exist a hash-link between and .
[00069] In an instance, for notation, the game theoretic system 110 may indicate the current iteration of the repeated game being realized/executed as “r”, current number of updates to the game as r*, and the current round of block proposal as “e”. Also, at any step of game consensus, r*=e.
[00070] Considering the game coin protocol, the game theoretic system 110 may first review the candidate block structures of blocks prepared by entities 102 to contend for consensus. The game theoretic system 110 may then define the rules for updating the digital wallets of players post block confirmation. For the game executing of blocks, the first kind of blocks that any entity 102 can prepare corresponds to taking actions under the most recent game r*, and includes “n” transactions from each of all n entities 102, where each transaction by entity 102 “i” may have the structure as in equation 4 below:
Sigi (EXECUTE, r, H (ai, )) …. Equation 4
In the above equation 4, the term ai? Ai and term may refer to a uniformly distributed nonce.
[00071] The game theoretic system 110 may denote a game execution block by entity 102 i ?[n] in epoch e as .
[00072] Further, for the game update blocks, the second kind of blocks that any entity 102 updating the definition of the game, and includes “n” transactions from each of all n entities 102, where each transaction by entity 102 “i” may have the structure as in equation 5 below:

Sigi (UPDATE, , )….Equation 5
In the above equation 5, the term may refer to revised set of actions for entity 102 “i”, the term may refer to revised payoff function for entity 102 “i”,
[00073] The game theoretic system 110 may denote a game execution block by player i ?[n] in epoch “e” as . The game update block can also be generated to accommodate a new player by appropriately generating update transactions for the new player, with the same structure.
[00074] Further, the game theoretic system 110 may also perform a transference of game coins and a wallet balance of the entities 102 post block confirmation. The blockchain cryptocurrency protocols may maintain game coin digital wallets where each player earns proportionately to its payoff under the blockchain recorded actions. For instance, given a game execution block is confirmed, once game execution block has sufficient depth in the blockchain network 112, the entity 102 i.e., player actions corresponding to that block are revealed by announcing the hash pre-images. Further, assuming that each player would be playing according to a Nash equilibrium a*? BR(G) corresponding to the most recently agreed game. The Nash equilibrium may be computed using a Nash equilibrium computation engine (not shown in FIGS.). The Nash equilibrium may include, but not limited to, evolutionary algorithms, particle swarm optimization algorithms, differential evolution algorithms, and the like. As per computational complexity theory, finding the Nash equilibrium strategy may be a Polynomial Parity Argument on Directed Graphs (PPAD) complexity problem, which may need specialized hardware to find the Nash equilibrium. After each game execution, the digital cryptocurrency wallet of player “i” may be credited with ui (a*). However, if a player defects from the equilibrium by action ? due to behavioral reasons to achieve a higher payoff ( )> , although the wallet of may be credited with ( ), may have to pay each j ? [n]\ , the loss uj (a*)-uj( ). Further, the game coin protocol pseudocode may be according to a blockchain consensus protocol as below:
Given:
An ideal CRHF H: {0; 1} * ?{0, 1} |?|
A signature scheme S = (dsig, dver)
Sigi(m): = (m, dsigski (m)) =1
where ?I, m dver (vki; Sigi(m)) = 1
procedure GC-PrepareGameBlocki
1: Discard older transactions based on epoch e, and rounds r, r*.
2a: Player i collects n execution transactions :={Sigj(EXECUTE, r H(aj, )}j?[n],
OR
2b: Prepare i collects n update transaction :={Sigj(UPDATE, )}j?[n]
3: Prepare block as one of or
end procedure
procedure GC-ProposeGameBlock ( i ?[n])
1: Agree on : = ?BlockchainConsensus( i ?[n])
2: e? e+1
3: if = , then r?r+1
4: if = , then r*?r*+1, r?0.
5: if = and is confirmed, then each player i?[n] announces (ai, ) corresponding to over the network [n]. Also, update the digital wallet of each player in [n] based on the transference rule.
end procedure.
[00075] Further, for realizing one shot game by revealing actions after block confirmation, consider a block only confirmed once it is sufficiently deep in the blockchain. Given that recording the hash of actions as part of transactions serves as a cryptographic commitment of those actions, the actions are only revealed (and consequent cryptocurrency transfers happen), once the said confirmed block is assured to be a part of the blockchain network 112. Further, for eliminating multiple actions in an execution, or game updates, by timestamping, a duplicate player actions and game updates by malicious network users may be eliminated by using timestamping as part of transactions. The transaction in any round or any value of iterators in {trun, tupd} with the earliest timestamp may be only one considered. Further, for fast confirmation of game execution / update through constant time blockchain consensus protocols, if Algorand may be used as the consensus protocol, for the routine Blockchain Consensus, it can be proven that a GameCoin block may be accepted in a matter of seconds, resulting in a fast game action / update confirmation.
Exemplary Scenario
[00076] For instance, a new set of rules may be provided, for transaction maturity, where the digital tokens transferred depend on the collective action of party-A and party-B (which can be generalized to n parties). For instance, continuing from the rock-paper-scissors game as shown in FIG. 2B, if party-A plays ‘rock’ and party-B players ‘scissors’, and both their actions are finalized on the blockchain network 112, then party-A gets T digital tokens from party-B (since ‘rock’ breaks ‘scissors’). However, if party-A plays ‘paper’ and party-B plays ‘scissors’, and both the party A and B actions are finalized on the blockchain network 112, then party-B gets T digital tokens from party-A (since ‘scissors’ cut ‘paper’).
[00077] A naive implementation of theoretical games over blockchains are susceptible to an action changing attack. For example, if party-B sees the action of party-A as `rock', before the action of party-A is confirmed on-chain, party-B can cheat by replacing its original action by `paper' (`paper' covers `rock'), resulting in the T digital tokens being transferred from party-A to party-B. According to an embodiment, the game coin, using a signature scheme, a hash function, and a nonce (which is a cryptographic equivalent of a one-time-password), all actions by all players are encrypted and committed as part of the blockchain network 112, and are revealed only once those actions are finalized, and consequently the digital token transactions are ready to be conducted. This eliminates the possibility by players to perform fraud, by changing their actions strategically on seeing other players' actions (as party-B cannot foresee the action of party-A as `rock').
[00078] In an embodiment, the transaction valuation policies may be determined by the game theoretic system 110 based on game theoretic rules, and these rules may also be recorded as part of the blockchain network 112. Since the game coin rules may be recorded blockchain network 112, they are updatable for instance all game coin participants can agree (blockchain network 112), that when a particular part wins in the \rock-paper-scissors game, the loser may have to pay the winner 2XT digital tokens instead of T digital tokens.
[00079] Referring FIG. 2B, assume n players in the game, using H to denote a collision-resistant cryptographic hash function. For an arbitrary message m, using Sigi(m) to denote a signed message m by player i ? {1, 2…n}, using ‘e’ to denote the block height in the blockchain (initially e = 0).
[00080] Finally, using ‘r’ to denote the number of rounds the game has undergone (initially r = 0), using wi to denote the wallet state of player i ? {1, 2,…n}on the blockchain network 112 (initially wi = 0 for each i). Consider, a basic familiarity with the Rock-Paper-Scissors recreational game for two players, with three playing options per player such as rock or paper or scissor. The game rules dictate that the player that wins gets 1 point, and the loser gets -1 point. On a draw, both players get 0 points. The winning/losing rules is shown in FIG. 2B. Whenever both players play the same option, a draw results.
Process Flow under GameCoin
[00081] GameCoin may allow the Rock-Paper-Scissors game to be played, using blockchains as a sequential log of the game interactions. The cumulative winnings of each player i in the Rock-Paper-Scissors game are given by the blockchain wallet wi. The execution of the Rock-Paper-Scissors game using for example, a streamlet blockchain, as a step-by-step process. Initially assuming e = 0, and wi = 0 for each i ? {1, 2,…n}. Considering, there are two aspects of GameCoin: recording and valuation of the game, this may be highlight both as below:
1. e = 0: All players record and notarize the game rules (from the previous section) in block B0, using the blockchain protocol. Set e?e + 1, and r?0.
2. e = 1: Set r ? r + 1. player 1 plays rock and player 3 plays scissor. All other players may not play. Player 1 announces Sig1(?, H(ROCK)) over the blockchain network 112, and Player 3 may announces Sig3(?, H(SCISSOR)). All players record and notarize the announcements from 1 and 3 in block B1, using the blockchain protocol.
3. e = 1: Player 1 announces Sig1(ROCK) over the blockchain network 112, and Player 3 announces Sig3(SCISSOR). All players validate the announcement using B1. By the game rules, player 1 wins and player 3 loses. So, w1 ?w1 + 1 and w3 ?w3 - 1. Set e ? e + 1.
4. e = 2: Set r ? r + 1. Player 3 plays rock and player 4 plays paper. All other players may not play. Player 3 announces Sig3(?, H(rock)) over the blockchain network 112, and player 4 announces Sig4(?, H(paper)). All players record and notarize the announcements from 3 and 4 in block B2, using the blockchain protocol.
5. e = 2: Player 3 announces Sig3(rock) over the blockchain network 112, and player 4 announces Sig4(paper). All players validate the announcement using B2. By the game rules, player 4 wins and player 3 loses. So w4 ? w4 + 1 and w3 ? w3 - 1. Set e ? e + 1.
6. e = 3: Set r ? r + 1. Player 1 plays rock and player 2 plays rock. All other players
don't play. Player 1 announces Sig1(?, H(ROCK)) over the blockchain network 112, and player 2 announces Sig2(?, H(ROCK)). All players record and notarize the announcements from 1 and 3 in block B3, using the blockchain protocol.
7. e = 3: Player 1 announces Sig1(rock) over the network, and player 2 announces Sig3(rock). All players validate the announcement using B3. By the game rules, neither player wins. So w1 ? w1 + 0 and w2 ? w2 + 0. Set e ? e + 1, and so on...
[00082] In an execution, game coin may also allow the game rules to be changed. For instance, if rock beats scissor, the winning player gets 2 points, but when paper beats rock, the winner gets 1:5 points. This may be performed using consensus on a block similar to block B0.
[00083] FIG. 3 illustrates a flow chart depicting a method 300 for processing game-theoretic interactions using blockchain architecture 112, in accordance with an embodiment of the present disclosure.
[00084] As illustrated in FIG. 3, the method 300 includes one or more blocks illustrating a method of processing game-theoretic interactions using blockchain architecture 112. The method 300 may be described in the general context of computer-executable instructions. Generally, computer-executable instructions can include routines, programs, objects, components, data structures, procedures, modules, and functions, which perform functions or implement abstract data types.
[00085] The order in which the method 300 is described is not intended to be construed as a limitation, and any number of the described method blocks can be combined in any order to implement the method 300. Additionally, individual blocks may be deleted from the methods without departing from the spirit and scope of the subject matter described herein. Furthermore, the method 300 can be implemented in any suitable hardware, software, firmware, or combination thereof.
[00086] At block 302, the method 300 may include receiving, by the processor 202, a, in response to initiation of an event, from each of a plurality of participating entities 102, at least one action from a defined set of possible actions.
[00087] At block 304, the method 300 may include transforming, by the processor 202, for each of the plurality of participating entities 102, the at least one received action into a unique identifier, and place said unique identifier onto a blockchain 112 in a manner such that the action selected by the respective participating entity is positioned on the blockchain 112 in the form of the corresponding unique identifier, but said action is hidden from the other entities until completion of the event.
[00088] At block 306, the method 300 may include executing, by the processor 202, upon placement of all unique identifiers of the participating entities 102 onto a block of the blockchain 102, a blockchain consensus protocol to confirm that the block is added to the blockchain 112, wherein each entity announces having undertaken its respective action post-placement of the corresponding unique identifier onto the blockchain 112.
[00089] At block 308, the method 300 may include allocating, by the processor 202, based on determination of outcome of the event upon its completion, a value to at least one of said plurality of participating entities, said outcome determination being made based on one or more rules associated with the event.
[00090] FIG. 4 illustrates an exemplary computer system in which or with which embodiments of the present invention can be utilized, in accordance with embodiments of the present disclosure.
[00091] In some embodiments, FIG. 4 illustrates a block diagram of an exemplary computer system 400 for implementing embodiments consistent with the present disclosure. In some embodiments, the computer system 400 can be a game theoretic system 110, which may be implemented on the one or more first computing devices 104 and the one or more second computing devices 104, that is used for processing game-theoretic interactions using blockchain architecture, as shown in the FIG. 4. The computer system 400 may include a central processing unit (“CPU” or “processor”) 402. The processor 402 may include at least one data processor for executing program components for executing user or system-generated business processes. A user may include a person, a person using a device such as those included in this present disclosure, or such a device itself. The processor 402 may include specialized processing units such as integrated system (bus) controllers, memory management control units, floating-point units, graphics processing units, digital signal processing units, etc. The processor 402 may be disposed in communication with input devices 411 and output devices 412 via I/O interface 401. The I/O interface 401 may employ communication protocols/methods such as, without limitation, audio, analog, digital, stereo, IEEE-1395, serial bus, Universal Serial Bus (USB), infrared, PS/2, BNC, coaxial, component, composite, Digital Visual Interface (DVI), high-definition multimedia interface (HDMI), Radio Frequency (RF) antennas, S-Video, Video Graphics Array (VGA), IEEE 802.n /b/g/n/x, Bluetooth, cellular (e.g., Code-Division Multiple Access (CDMA), High-Speed Packet Access (HSPA+), Global System For Mobile Communications (GSM), Long-Term Evolution (LTE), WiMax, or the like), etc.
[00092] Using the I/O interface 401, computer system 400 may communicate with input devices 411 and output devices 412. In some embodiments, the processor 402 may be disposed in communication with a communication network 409 via a network interface 403. The network interface 403 may communicate with the communication network 409. The network interface 403 may employ connection protocols including, without limitation, direct connect, Ethernet (e.g., twisted pair 10/100/1000 Base T), Transmission Control Protocol/Internet Protocol (TCP/IP), token ring, IEEE 802.11a/b/g/n/x, etc. Using the network interface 403 and the communication network 409, the computer system 400 may communicate with the one or more first computing device 104, the one or more first computing device 104, and the blockchain network 112. The computer system 400 may include at least one of, a mobile, a smart phone, a tablet, a phablet, a personal digital assistant, a computer, a laptop, a server, and the like. The computer system 400 may associated with the one or more first computing device 104, and/or the one or more first computing device 104. The processes of the one or more first computing device 104, and/or the one or more first computing device 104 may be implemented on the computer system 400.
[00093] The communication network 409 can be implemented as one of the different types of networks, such as intranet or Local Area Network (LAN) and such within the organization. The communication network 409 may either be a dedicated network or a shared network, which represents an association of the different types of networks that use a variety of protocols, for example, Hypertext Transfer Protocol (HTTP), Transmission Control Protocol/Internet Protocol (TCP/IP), Wireless Application Protocol (WAP), etc., to communicate with each other. Further, the communication network 409 may include a variety of network devices, including routers, bridges, servers, computing devices, storage devices, etc. In some embodiments, the processor 402 may be disposed in communication with a memory 405 (e.g., RAM, ROM, etc. not shown in FIG. 4) via a storage interface 404. The storage interface 404 may connect to memory 405 including, without limitation, memory drives, removable disc drives, etc., employing connection protocols such as Serial Advanced Technology Attachment (SATA), Integrated Drive Electronics (IDE), IEEE-1395, Universal Serial Bus (USB), fibre channel, Small Computer Systems Interface (SCSI), etc. The memory drives may further include a drum, magnetic disc drive, magneto-optical drive, optical drive, Redundant Array of Independent Discs (RAID), solid-state memory devices, solid-state drives, etc. The memory 405 may store a collection of program or database components, including, without limitation, a user interface 406, an operating system 407, a web browser 408, etc. In some embodiments, the computer system 400 may store user/application data, such as the data, variables, records, etc. as described in this invention. Such databases may be implemented as fault-tolerant, relational, scalable, secure databases such as Oracle or Sybase. Operating system 407 may facilitate resource management and operation of the computer system 400. Examples of operating systems include, without limitation, APPLE® MACINTOSH® OS X®, UNIX®, UNIX-like system distributions (E.G., BERKELEY SOFTWARE DISTRIBUTION® (BSD), FREEBSD®, NETBSD®, OPENBSD, etc.), LINUX® DISTRIBUTIONS (E.G., RED HAT®, UBUNTU®, KUBUNTU®, etc.), IBM®OS/2®, MICROSOFT® WINDOWS® (XP®, VISTA®/7/8, 10 etc.), APPLE® IOS®, GOOGLETM ANDROIDTM, BLACKBERRY® OS, or the like. User interface 406 may facilitate display, execution, interaction, manipulation, or operation of program components through textual or graphical facilities. For example, user interfaces may provide computer interaction interface elements on a display system operatively connected to computer system 400, such as cursors, icons, checkboxes, menus, scrollers, windows, widgets, etc. Graphical User Interfaces (GUIs) may be employed, including, without limitation, Apple® Macintosh® operating systems’ Aqua®, IBM® OS/2®, Microsoft® Windows® (e.g., Aero, Metro, etc.), web interface libraries (e.g., ActiveX®, Java®, Javascript®, AJAX, HTML, Adobe® Flash®, etc.), or the like.
[00094] Computer system 400 may implement a web browser 408 stored-program components. Web browser 408 may be a hypertext viewing application, such as MICROSOFT® INTERNET EXPLORER®, GOOGLETM CHROMETM, MOZILLA® FIREFOX®, APPLE® SAFARI®, etc. Secure web browsing may be provided using Secure Hypertext Transport Protocol (HTTPS), Secure Sockets Layer (SSL), Transport Layer Security (TLS), etc. Web browsers 408 may utilize facilities such as AJAX, DHTML, ADOBE® FLASH®, JAVASCRIPT®, JAVA®, Application Programming Interfaces (APIs), etc. Computer system 400 may implement a mail server stored program component. The mail server may be an Internet mail server such as Microsoft Exchange, or the like. The mail server may utilize facilities such as ASP, ACTIVEX®, ANSI® C++/C#, MICROSOFT®, NET, CGI SCRIPTS, JAVA®, JAVASCRIPT®, PERL®, PHP, PYTHON®, WEBOBJECTS®, etc. The mail server may utilize communication protocols such as Internet Message Access Protocol (IMAP), Messaging Application Programming Interface (MAPI), MICROSOFT® exchange, Post Office Protocol (POP), Simple Mail Transfer Protocol (SMTP), or the like. In some embodiments, the computer system 400 may implement a mail client stored program component. The mail client may be a mail viewing application, such as APPLE® MAIL, MICROSOFT® ENTOURAGE®, MICROSOFT® OUTLOOK®, MOZILLA® THUNDERBIRD®, etc. Furthermore, one or more computer-readable storage media may be utilized in implementing embodiments consistent with the present invention. A computer-readable storage medium refers to any type of physical memory on which information or data readable by a processor may be stored. Thus, a computer-readable storage medium may store instructions for execution by one or more processors, including instructions for causing the processor(s) to perform steps or stages consistent with the embodiments described herein. The term “computer-readable medium” should be understood to include tangible items and exclude carrier waves and transient signals, i.e., non-transitory. Examples include Random Access Memory (RAM), Read-Only Memory (ROM), volatile memory, non-volatile memory, hard drives, Compact Disc (CD) ROMs, Digital Video Disc (DVDs), flash drives, disks, and any other known physical storage media.
[00095] As used herein, and unless the context dictates otherwise, the term “coupled to” is intended to include both direct coupling (in which two elements that are coupled to each other or in contact with each other) and indirect coupling (in which at least one additional element is located between the two elements). Therefore, the terms “coupled to” and “coupled with” are used synonymously. Within the context of this document terms “coupled to” and “coupled with” are also used euphemistically to mean “communicatively coupled with” over a network, where two or more devices are able to exchange data with each other over the network, possibly via one or more intermediary device.
[00096] Moreover, in interpreting both the specification and the claims, all terms should be interpreted in the broadest possible manner consistent with the context. In particular, the terms “comprises” and “comprising” should be interpreted as referring to elements, components, or steps in a non-exclusive manner, indicating that the referenced elements, components, or steps may be present, or utilized, or combined with other elements, components, or steps that are not expressly referenced. Where the specification claims refer to at least one of something selected from the group consisting of A, B, C ….and N, the text should be interpreted as requiring only one element from the group, not A plus N, or B plus N, etc.
[00097] While some embodiments of the present disclosure have been illustrated and described, those are completely exemplary in nature. The disclosure is not limited to the embodiments as elaborated herein only and it would be apparent to those skilled in the art that numerous modifications besides those already described are possible without departing from the inventive concepts herein. All such modifications, changes, variations, substitutions, and equivalents are completely within the scope of the present disclosure. The inventive subject matter, therefore, is not to be restricted except in the spirit of the appended claims.

ADVANTAGES OF THE INVENTION
[00098] The present invention provides efficient and secure system and method for processing game-theoretic interactions using blockchain architecture. Embodiments herein provide system and method for recording and valuation of game theoretic interactions using blockchain consensus protocols. Embodiments herein provide system and method for realizing single game by revealing actions after block confirmation in the blockchain network. Embodiments herein provide system and method for eliminating multiple actions in an execution, or game updates, by timestamping. Embodiments herein provide system and method for fast confirmation of game execution / update through constant time blockchain consensus protocols. Embodiments herein provide system and method for eliminating fraud from participant players, by using secure protocol game coin. Embodiments herein formalize game theoretic interactions, and serve as a decentralized system for organizations to define and deploy arbitrary games of player’s interest.

We Claims:

1. A game theoretic system (110) for processing game-theoretic interactions using blockchain architecture (112), said game theoretic system (110) comprising:
a processor (202);
a memory (206) comprising a set of instructions, which when executed by the processor (202) cause the processor (202) to:
receive, in response to initiation of an event, from each of a plurality of participating entities (102), at least one action from a defined set of possible actions;
transform, for each of the plurality of participating entities (102), the at least one received action into a unique identifier, and place said unique identifier onto a blockchain (112) in a manner such that the action selected by the respective participating entity (102) is positioned on the blockchain (112) in the form of the corresponding unique identifier, but said action is hidden from the other entities (102) until completion of the event;
upon placement of all unique identifiers of the participating entities (102) onto a block of the blockchain (112), execute a blockchain consensus protocol to confirm that the block is added to the blockchain (112), wherein each entity (102) announces having undertaken its respective action post-placement of the corresponding unique identifier onto the blockchain (112); and
based on determination of outcome of the event upon its completion, allocate a value to at least one of said plurality of participating entities (102), said outcome determination being made based on one or more rules associated with the event.
2. The game theoretic system (110) as claimed in claim 1, wherein genesis block of the blockchain (112) comprises the one or more rules associated with the event.
3. The game theoretic system (110) as claimed in claim 2, wherein a block following the genesis block of the blockchain (112) comprises updates to the one or more rules stored in the genesis block.
4. The game theoretic system (110) as claimed in claim 1, wherein the transformation is undertaken through a combination of a cryptographic hash function and a signature scheme.
5. The game theoretic system (110) as claimed in claim 1, wherein the transformation is undertaken through a collision resistant transformation function.
6. The game theoretic system (110) as claimed in claim 1, wherein the unique identifier is obtained based on processing of a time secret random string with the action selected by the respective entity (102), wherein the at least one action, from each of a plurality of participating entities (102) is received through a Nash equilibrium computation engine for computing a Nash equilibrium.
7. The game theoretic system (110) as claimed in claim 1, wherein the entity (102) announces having undertaken its respective action by means of a signed message that maps to the unique identifier.
8. The game theoretic system (110) as claimed in claim 1, wherein the unique identifiers of all participating entities (102) are collected and placed onto payload of the blockchain (112) together.
9. The game theoretic system (110) as claimed in claim 1, wherein upon placement of a selected action by respective entity (102) on the blockchain (112), said respective entity (102) is not allowed to modify the blockchain-placed action.
10. The game theoretic system (110) as claimed in claim 1, wherein said event comprises one or more rounds such that the plurality of participating entities (102) select actions from the defined set of possible actions in each of the one or more rounds.
11. A method for processing game-theoretic interactions using blockchain architecture (112), the method comprising:
receiving, by a processor (202) associated with a game theoretic system (110), in response to initiation of an event, from each of a plurality of participating entities (102), at least one action from a defined set of possible actions;
transforming, by the processor (202), for each of the plurality of participating entities (102), the at least one received action into a unique identifier, and place said unique identifier onto a blockchain (112) in a manner such that the action selected by the respective participating entity (102) is positioned on the blockchain (112) in the form of the corresponding unique identifier, but said action is hidden from the other entities (102) until completion of the event;
upon placement of all unique identifiers of the participating entities (102) onto a block of the blockchain (112), executing, by the processor (202), a blockchain consensus protocol to confirm that the block is added to the blockchain (112), wherein each entity (102) announces having undertaken its respective action post-placement of the corresponding unique identifier onto the blockchain (112); and
based on determination of outcome of the event upon its completion, allocating, by the processor (202), a value to at least one of said plurality of participating entities (102), said outcome determination being made based on one or more rules associated with the event.
12. The method as claimed in claim 11, wherein genesis block of the blockchain (112) comprises the one or more rules associated with the event.
13. The method as claimed in claim 12, wherein a block following the genesis block of the blockchain (112) comprises updates to the one or more rules stored in the genesis block.
14. The method as claimed in claim 11, wherein the transformation is undertaken through a combination of a cryptographic hash function and a signature scheme.
15. The method as claimed in claim 11, wherein the transformation is undertaken through a collision resistant transformation function.
16. The method as claimed in claim 11, wherein the unique identifier is obtained based on processing of a time secret random string with the action selected by the respective entity (102), wherein the at least one action, from each of a plurality of participating entities (102) is received through a Nash equilibrium computation engine for computing a Nash equilibrium.
17. The method as claimed in claim 11, wherein the entity (102) announces having undertaken its respective action by means of a signed message that maps to the unique identifier.
18. The method as claimed in claim 11, wherein the unique identifiers of all participating entities (102) are collected and placed onto payload of the blockchain (112) together.
19. The method as claimed in claim 11, wherein upon placement of a selected action by respective entity (102) on the blockchain (112), said respective entity (102) is not allowed to modify the blockchain-placed action.
20. The method as claimed in claim 11, wherein said event comprises one or more rounds such that the plurality of participating entities (102) select actions from the defined set of possible actions in each of the one or more rounds.