Serious Games in Economics

The European Leonardo da Vinci Transfer of Innovation project “Teacher training to improve attractiveness and quality of management education through the simulation tool ‘Emerald Forest’” which emphases on using the computer simulation tool for increasing attractiveness of teaching and learning in economics is presented in this paper. The observation of using computer systems and especially serious games in education is provided as well. “Education is not the filling of a pail, but the lighting of a fire” - William Butler Yeats

Existence Theorems for Non-Cooperative Elliptic Systems

2010 Mathematics Subject Classification: 35J65, 35K60, 35B05, 35R05.

Ergodic Rates of the Fast Rayleigh Fading Relay Channel for Different Cooperative Strategies

ACM Computing Classification System (1998): E.4, C.2.1.

Cooperation in supply chains: A cooperative game theoretic analysis = Együttműködés ellátási láncokban: Egy kooperatív játékelméleti elemzés

A cikkben a kooperatív játékelmélet fogalmait alkalmazzuk egy ellátási lánc esetében. Az ostorcsapás-hatás elemeit egy beszállító-termelő ellátási láncban ragadjuk meg egy Arrow-Karlin típusú modellben lineáris készletezési és konvex termelési költség mellett. Feltételezzük, hogy mindkét vállalat minimalizálja a fontosabb költségeit. Két működési rendszert hasonlítunk össze: egy hierarchikus döntéshozatali rendszert, amikor először a termelő, majd a beszállító optimalizálja helyzetét, majd egy centralizált (kooperatív) modellt, amikor a vállalatok az együttes költségüket minimalizálják. A kérdés úgy merül fel, hogy a csökkentett ostorcsapás-hatás esetén hogyan osszák meg a részvevők ebben a transzferálható hasznosságú kooperatív játékban. = In this paper we apply cooperative game theory concepts to analyze supply chains. The bullwhip effect in a two-stage supply chain (supplier-manufacturer) in the framework of the Arrow-Karlin model with linear-convex cost functions is considered. It is assumed that both firms minimize their relevant costs, and two cases are examined: the supplier and the manufacturer minimize their relevant costs in a decentralized and in a centralized (cooperative) way. The question of how to share the savings of the decreased bullwhip effect in the centralized (cooperative) model is answered by transferable utility cooperative game theory tools.

Cooperation in an HMMS-type supply chain: A management application of cooperative game theory = Kooperáció egy HMMS-típusú ellátási láncban: A kooperatív játékelmélet egy menedzsment alkalmazása

We apply cooperative game theory concepts to analyze a Holt-Modigliani-Muth-Simon (HMMS) supply chain. The bullwhip effect in a two-stage supply chain (supplier-manufacturer) in the framework of the HMMS-model with quadratic cost functions is considered. It is assumed that both firms minimize their relevant costs, and two cases are examined: the supplier and the manufacturer minimize their relevant costs in a decentralized and in a centralized (cooperative) way. The question of how to share the savings of the decreased bullwhip effect in the centralized (cooperative) model is answered by the weighted Shapley value, by a transferable utility cooperative game theory tool, where the weights are for the exogenously given “bargaining powers” of the participants of the supply chain. = A cikkben a kooperatív játékelmélet fogalmait alkalmazzuk egy Holt-Mogigliani-Muth-Simon-típusú ellátási lánc esetében. Az ostorcsapás-hatás elemeit egy beszállító-termelő ellátási láncban ragadjuk meg egy kvadratikus készletezési és termelési költség mellett. Feltételezzük, hogy mindkét vállalat minimalizálja a releváns költségeit. Két működési rendszert hasonlítunk össze: egy hierarchikus döntéshozatali rendszert, amikor először a termelő, majd a beszállító optimalizálja helyzetét, majd egy centralizált (kooperatív) modellt, amikor a vállalatok az együttes költségüket minimalizálják. A kérdés úgy merül fel, hogy a csökkentett ostorcsapás-hatás esetén hogyan osszák meg a részvevők ebben a transzferálható hasznosságú kooperatív játékban a költség megtakarítást, exogén módon adott tárgyalási pozíció mellett.

Price vs. quantity in oligopoly games

Price-setting and quantity-setting oligopoly games lead to extremely dierent outcomes in the market. One natural way to address this problem is to formulate a model in which some rms use price while the remaining rms use quantity as their decision variable. We introduce a mixed oligopoly game of this type and determine its equilibria. In addition, we consider an extension of this mixed oligopoly game through which the choice of the decision variables can be endogenized. We prove the emergence of the Cournot game.

Quantity-setting games with a dominant firm

We consider a possible game-theoretic foundation of Forchheimer's model of dominant-firm price leadership based on quantity-setting games with one large firm and many small firms. If the large firm is the exogenously given first mover, we obtain Forchheimer's model. We also investigate whether the large firm can emerge as a first mover of a timing game.

Generalized correlated equilibrium for two-person games in extensive form with perfect information

A correlation scheme (leading to a special equilibrium called “soft” correlated equilibrium) is applied for two-person finite games in extensive form with perfect information. Randomization by an umpire takes place over the leaves of the game tree. At every decision point players have the choice either to follow the recommendation of the umpire blindly or freely choose any other action except the one suggested. This scheme can lead to Pareto-improved outcomes of other correlated equilibria. Computational issues of maximizing a linear function over the set of soft correlated equilibria are considered and a linear-time algorithm in terms of the number of edges in the game tree is given for a special procedure called “subgame perfect optimization”.

The Shapley value for shortest path games

In this paper shortest path games are considered. The transportation of a good in a network has costs and benet too. The problem is to divide the prot of the transportation among the players. Fragnelli et al (2000) introduce the class of shortest path games, which coincides with the class of monotone games. They also give a characterization of the Shapley value on this class of games. In this paper we consider further four characterizations of the Shapley value (Shapley (1953)'s, Young (1985)'s, Chun (1989)'s, and van den Brink (2001)'s axiomatizations), and conclude that all the mentioned axiomatizations are valid for shortest path games. Fragnelli et al (2000)'s axioms are based on the graph behind the problem, in this paper we do not consider graph specic axioms, we take TU axioms only, that is, we consider all shortest path problems and we take the view of abstract decision maker who focuses rather on the abstract problem than on the concrete situations.

Convex and exact games with non-transferable utility

We generalize exactness to games with non-transferable utility (NTU). A game is exact if for each coalition there is a core allocation on the boundary of its payoff set. Convex games with transferable utility are well-known to be exact. We consider ve generalizations of convexity in the NTU setting. We show that each of ordinal, coalition merge, individual merge and marginal convexity can be uni¯ed under NTU exactness. We provide an example of a cardinally convex game which is not NTU exact. Finally, we relate the classes of Π-balanced, totally Π-balanced, NTU exact, totally NTU exact, ordinally convex, cardinally convex, coalition merge convex, individual merge convex and marginal convex games to one another.

Osztozkodási játékok (Games of fair division)

In this survey we presented several proportional and envy-free cake-cutting algorithms. We also mentioned some interesting open problems.

Stochastic bankruptcy games

We study bankruptcy games where the estate and the claims have stochastic values. We use the Weak Sequential Core as the solution concept for such games. We test the stability of a number of well known division rules in this stochastic setting and find that most of them are unstable, except for the Constrained Equal Awards rule, which is the only one belonging to the Weak Sequential Core.

Transferable Utility Games with Uncertainty

We introduce the concept of a TUU-game, a transferable utility game with uncertainty. In a TUU-game there is uncertainty regarding the payoffs of coalitions. One out of a finite number of states of nature materializes and conditional on the state, the players are involved in a particular transferable utility game. We consider the case without ex ante commitment possibilities and propose the Weak Sequential Core as a solution concept. We characterize the Weak Sequential Core and show that it is non-empty if all ex post TUgames are convex.

Transferable Utility Games with Uncertainty

We introduce the concept of a TUU-game, a transferableutilitygame with uncertainty. In a TUU-game there is uncertainty regarding the payoffs of coalitions. One out of a finite number of states of nature materializes and conditional on the state, the players are involved in a particular transferableutilitygame. We consider the case without ex ante commitment possibilities and propose the Weak Sequential Core as a solution concept. We characterize the Weak Sequential Core and show that it is non-empty if all ex post TU-games are convex.

A Note on The Weak Sequential Core of Dynamic TU Games

This paper addresses a problem with an argument in Kranich, Perea, and Peters (2005) supporting their definition of the Weak Sequential Core and their characterization result. We also provide the remedy, a modification of the definition, to rescue the characterization.