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.

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.

A gabonaszállítási piac színe és visszája Magyarországon (The pros and contras of the Hungarian cereals transportation market)

A tanulmány a szakirodalomban újszerű kezdeményezésként kísérletet tesz a gabonapiac ellátási láncának felrajzolására, majd annak egyik, a cikk alapkérdése szempontjából kiemelt vetületét, a gabonaszállítási és raktározási problémákat elemzi. Előbbit a piac szereplőitől kvalitatív módon begyűjtött információkkal, utóbbit a szakirodalom alapján mutatja be. A cikk az elemzés után javaslatokkal szolgál ahhoz, hogyan lehetne hazánkban egy integrált gabonapiaci szállítási-raktározási-átrakási rendszert kialakítani. __________ The aim of the article is to present the situation of the Hungarian cereals transport and storage-reloading market and by interconnection, to treat cereals market’s operations systemically. Under this process, the study trace to draw a possible supply chain of the national cereals market up, which is a new initiation in the Hungarian literature. The focus of the article is to analyse transport and storage processes in the cereals market using the framework mentioned above. Transport market is demonstrated on the grounds of a revealing qualitative research, while storage market is brought out by literature. After analysis, the article gives recommendations how to shape an integrated transport and storage-reload system in the Hungarian cereals market.