Combinatorial Structures to Modeling Simple Games and Applications
نویسنده
چکیده
We connect three different topics: combinatorial structures, game theory and chemistry. In particular, we establish the bases to represent some simple games, defined as influence games, and molecules, defined from atoms, by using combinatorial structures. First, we characterize simple games as influence games using influence graphs. It let us to modeling simple games as combinatorial structures (from the viewpoint of structures or graphs). Second, we formally define molecules as combinations of atoms. It let us to modeling molecules as combinatorial structures (from the viewpoint of combinations). It is open to generate such combinatorial structures using some specific techniques as genetic algorithms, (meta-)heuristics algorithms and parallel programming, among others.
منابع مشابه
Combinatorial Structures to Represent Simple Games
We connect three different topics: combinatorial structures, simple games and influence games. We establish the bases to represent some simple games or some influence games by using combinatorial structures. These considerations are also able to generate any object of any topic based in graphs, for instance, molecules applied to chemistry, among others. Key–Words: Combinatorial Structures, Gene...
متن کاملA review on symmetric games: theory, comparison and applications
Game theory models decision makers' behaviors in strategic situations. Since the structures of games are different, behavior and preferences of the players are different in various types of game. This paper reviews various situations of games. Here, characteristics of some common games are discussed and compared. Specifically, we focus on a group of games called symmetric games including Prison...
متن کاملDynamic system of strategic games
Maybe an event can't be modeled completely through one game but there is more chance with several games. With emphasis on players' rationality, we present new properties of strategic games, which result in production of other games. Here, a new attitude to modeling will be presented in game theory as dynamic system of strategic games and its some applications such as analysis of the clash betwe...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملMaximal elements of $mathscr{F}_{C,theta}$-majorized mappings and applications to generalized games
In the paper, some new existence theorems of maximal elements for $mathscr{F}_{C,theta}$-mappings and $mathscr{F}_{C,theta}$-majorized mappings are established. As applications, some new existence theorems of equilibrium points for one-person games, qualitative games and generalized games are obtained. Our results unify and generalize most known results in recent literature.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017