entrepreneurship has been known as a method of identifying new opportunities, allocating resources in the situation of uncertainty and creating an organization to manage resources. this paper describes religious learning approaches in which entrepreneurship is beneficial to society and individuals through its economic advantages. the benefits are gained through innovation, productivity and new ...

Algorithms for pruning game trees generally rely on a game being zero-sum, in the case of alpha-beta pruning, or constant-sum, in the case of multi-player pruning algorithms such as speculative pruning. While existing algorithms can prune non-zero-sum games, pruning is much less effective than in constant-sum games. We introduce the idea of leaf-value tables, which store an enumeration of the p...

In this paper, we deal with games with fuzzy payoffs. We proved that players who are playing a zero-sum game with fuzzy payoffs against Nature are able to increase their joint payoff, and hence their individual payoffs by cooperating. It is shown that, a cooperative game with the fuzzy characteristic function can be constructed via the optimal game values of the zero-sum games with fuzzy payoff...

We have benefited from the helpful comments of Dan Kovenock, Wolfgang Leininger, and participants in the presentation at the CESifo Summer Institute Workshop on Advances in the Theory of Contests and its Applications. Brian Roberson Miami University, Department of Economics, Richard T. Farmer School of Business, 208 Laws Hall, Oxford, OH 45056-3628 USA t: 513-529-0416, f: 513-529-8047, E-mail: ...

Joyal’s categorical construction on (well-founded) Conway games and winning strategies provides a compact closed category, where tensor and linear implication are defined via Conway disjunctive sum (in combination with negation for linear implication). The equivalence induced on games by the morphisms coincides with the contextual closure of the equideterminacy relation w.r.t. the disjunctive s...

In this paper, we continue the study of the domination game in graphs introduced by Bre{v{s}}ar, Klav{v{z}}ar, and Rall. We study the paired-domination version of the domination game which adds a matching dimension to the game. This game is played on a graph $G$ by two players, named Dominator and Pairer. They alternately take turns choosing vertices of $G$ such that each vertex chosen by Domin...