Nothing so certain as your anchors? A consumer bias that might lower prices

Anchoring is a well-known decision-making bias: original guesses for a certain question could act as anchors and could influence our final answers. Reference prices - in a similar fashion - can lead to a bias in consumer valuations, and thus consumer demand will be coherent but not one derived from a utility framework. In our paper we investigate the effect of the existence of anchoring on how oligopolistic firms might change their pricing strategy. More specifically, we analyze the effect of anchoring on pricing when differentiated firms compete in Bertrand fashion. We show that if the anchoring effect is smaller than a threshold the average price is lower compared to the no-anchoring case.

Fogalmak, módszerek. Páros összehasonlításokon alapuló rangsorolási módszerek (Ranking methods based on paired comparisons)

A páronként összehasonlított alternatívák rangsorolásának problémája egyaránt felmerül a szavazáselmélet, a statisztika, a tudománymetria, a pszichológia és a sport területén. A nemzetközi szakirodalom alapján részletesen áttekintjük a megoldási lehetőségeket, bemutatjuk a gyakorlati alkalmazások során fellépő kérdések kezelésének, a valós adatoknak megfelelő matematikai környezet felépítésének módjait. Kiemelten tárgyaljuk a páros összehasonlítási mátrix megadását, az egyes pontozási eljárásokat és azok kapcsolatát. A tanulmány elméleti szempontból vizsgálja a Perron-Frobenius tételen alapuló invariáns, fair bets, PageRank, valamint az irányított gráfok csúcsainak rangsorolásra javasolt internal slackening és pozíciós erő módszereket. A közülük történő választáshoz az axiomatikus megközelítést ajánljuk, ennek keretében bemutatjuk az invariáns és a fair bets eljárások karakterizációját, és kitérünk a módszerek vitatható tulajdonságaira. _____ The ranking of the alternatives or selecting the best one are fundamental issues of social choice theory, statistics, psychology and sport. Different solution concepts, and various mathematical models of applications are reviewed based on the international literature. We are focusing on the de¯nition of paired comparison matrix, on main scoring procedures and their relation. The paper gives a theoretical analysis of the invariant, fair bets and PageRank methods, which are founded on Perron-Frobenius theorem, as well as the internal slackening and positional power procedures used for ranking the nodes of a directed graph. An axiomatic approach is proposed for the choice of an appropriate method. Besides some known characterizations for the invariant and fair bets methods, we also discuss the violation of some properties, meaning their main weakness.

Martingálmértékek és a várható diszkontált jelenérték szabály (Martingale measures and the law of the discounted present value)

A dolgozatban a legegyszerűbb kérdést feszegetjük: Hogyan kell az árakat meghatározni véletlen jövőbeli kifizetések esetén. A tárgyalás némiképpen absztrakt, de a funkcionálanalízis néhány közismert tételén kívül semmilyen más mélyebb matematikai területre nem kell hivatkozni. A dolgozat kérdése, hogy miként indokolható a várható jelenérték szabálya, vagyis hogy minden jövőbeli kifizetés jelen időpontban érvényes ára a jövőbeli kifizetés diszkontált várható értéke. A dologban az egyetlen csavar az, hogy a várható értékhez tartozó valószínűségi mértékről nem tudunk semmit. Csak annyit tudunk, hogy létezik a matematikai pénzügyek legtöbbet hivatkozott fogalma, a misztikus Q mérték. A dolgozat megírásának legfontosabb indoka az volt, hogy megpróbáltam kiiktatni a megengedett portfólió fogalmát a származtatott termékek árazásának elméletéből. Miként közismert, a származtatott termékek árazásának elmélete a fedezés fogalmára épül. (...) ____ In the article the author discusses some problems of the existence of the martingale measure. In continuous time models one should restrict the set of self financing portfolios and introduce the concept of the admissible portfolios. But to define the admissible portfolios one should either define them under the martingale measure or to turn the set of admissible portfolios to a cone which makes the interpretation of the pricing formula difficult.

A Kullback-Leibler relatív entrópia függvény alkalmazása páros összehasonlítás mátrix egy prioritásvektora meghatározására (Applying the Kullback-Leibler relative entropy function for determining priorities for the pairwise comparison matrix)

A dolgozatban a döntéselméletben fontos szerepet játszó páros összehasonlítás mátrix prioritásvektorának meghatározására új megközelítést alkalmazunk. Az A páros összehasonlítás mátrix és a prioritásvektor által definiált B konzisztens mátrix közötti eltérést a Kullback-Leibler relatív entrópia-függvény segítségével mérjük. Ezen eltérés minimalizálása teljesen kitöltött mátrix esetében konvex programozási feladathoz vezet, nem teljesen kitöltött mátrix esetében pedig egy fixpont problémához. Az eltérésfüggvényt minimalizáló prioritásvektor egyben azzal a tulajdonsággal is rendelkezik, hogy az A mátrix elemeinek összege és a B mátrix elemeinek összege közötti különbség éppen az eltérésfüggvény minimumának az n-szerese, ahol n a feladat mérete. Így az eltérésfüggvény minimumának értéke két szempontból is lehet alkalmas az A mátrix inkonzisztenciájának a mérésére. _____ In this paper we apply a new approach for determining a priority vector for the pairwise comparison matrix which plays an important role in Decision Theory. The divergence between the pairwise comparison matrix A and the consistent matrix B defined by the priority vector is measured with the help of the Kullback-Leibler relative entropy function. The minimization of this divergence leads to a convex program in case of a complete matrix, leads to a fixed-point problem in case of an incomplete matrix. The priority vector minimizing the divergence also has the property that the difference of the sums of elements of the matrix A and the matrix B is n times the minimum of the divergence function where n is the dimension of the problem. Thus we developed two reasons for considering the value of the minimum of the divergence as a measure of inconsistency of the matrix A.

The Kreps-Scheinkman game in mixed duopolies

In this paper we extend the results of Kreps and Scheinkman (1983) to mixedduopolies. We show that quantity precommitment and Bertrand competition yield Cournot outcomes not only in the case of private firms but also when a public firm is involved.

On the impossibility of fair risk allocation

Measuring and allocating risk properly are crucial for performance evaluation and internal capital allocation of portfolios held by banks, insurance companies, investment funds and other entities subject to financial risk. We show that by using coherent measures of risk it is impossible to allocate risk satisfying simultaneously the natural requirements of Core Compatibility, Equal Treatment Property and Strong Monotonicity. To obtain the result we characterize the Shapley value on the class of totally balanced games and also on the class of exact games.

Properties of risk capital allocation methods: Core Compatibility, Equal Treatment Property and Strong Monotonicity

In finance risk capital allocation raises important questions both from theoretical and practical points of view. How to share risk of a portfolio among its subportfolios? How to reserve capital in order to hedge existing risk and how to assign this to different business units? We use an axiomatic approach to examine risk capital allocation, that is we call for fundamental properties of the methods. Our starting point is Csóka and Pintér (2011) who show by generalizing Young (1985)'s axiomatization of the Shapley value that the requirements of Core Compatibility, Equal Treatment Property and Strong Monotonicity are irreconcilable given that risk is quantified by a coherent measure of risk. In this paper we look at these requirements using analytic and simulations tools. We examine allocation methods used in practice and also ones which are theoretically interesting. Our main result is that the problem raised by Csóka and Pintér (2011) is indeed relevant in practical applications, that is it is not only a theoretical problem. We also believe that through the characterizations of the examined methods our paper can serve as a useful guide for practitioners.

Lexicographic allocations and extreme core payoffs: the case of assignment games

We consider various lexicographic allocation procedures for coalitional games with transferable utility where the payoffs are computed in an externally given order of the players. The common feature of the methods is that if the allocation is in the core, it is an extreme point of the core. We first investigate the general relationship between these allocations and obtain two hierarchies on the class of balanced games. Secondly, we focus on assignment games and sharpen some of these general relationship. Our main result is the coincidence of the sets of lemarals (vectors of lexicographic maxima over the set of dual coalitionally rational payoff vectors), lemacols (vectors of lexicographic maxima over the core) and extreme core points. As byproducts, we show that, similarly to the core and the coalitionally rational payoff set, also the dual coalitionally rational payoff set of an assignment game is determined by the individual and mixed-pair coalitions, and present an efficient and elementary way to compute these basic dual coalitional values. This provides a way to compute the Alexia value (the average of all lemacols) with no need to obtain the whole coalitional function of the dual assignment game.

A cardinally convex game with empty core

In this note we present a cardinally convex game (Sharkey, 1981) with empty core. Sharkey assumes that V (N) is convex, we do not do so, hence we do not contradict Sharkey's result.

Ranking in Swiss system chess team tournaments

The paper uses paired comparison-based scoring procedures for ranking the participants of a Swiss system chess team tournament. We present the main challenges of ranking in Swiss system, the features of individual and team competitions as well as the failures of official lexicographical orders. The tournament is represented as a ranking problem, our model is discussed with respect to the properties of the score, generalized row sum and least squares methods. The proposed procedure is illustrated with a detailed analysis of the two recent chess team European championships. Final rankings are compared by their distances and visualized with multidimensional scaling (MDS). Differences to official ranking are revealed by the decomposition of least squares method. Rankings are evaluated by prediction accuracy, retrodictive performance, and stability. The paper argues for the use of least squares method with a results matrix favoring match points.

Measuring centrality by a generalization of degree

Network analysis has emerged as a key technique in communication studies, economics, geography, history and sociology, among others. A fundamental issue is how to identify key nodes in a network, for which purpose a number of centrality measures have been developed. This paper proposes a new parametric family of centrality measures called generalized degree. It is based on the idea that a relationship to a more interconnected node contributes to centrality in a greater extent than a connection to a less central one. Generalized degree improves on degree by redistributing its sum over the network with the consideration of the global structure. Application of the measure is supported by a set of basic properties. A sufficient condition is given for generalized degree to be rank monotonic, excluding counter-intuitive changes in the centrality ranking after certain modifications of the network. The measure has a graph interpretation and can be calculated iteratively. Generalized degree is recommended to apply besides degree since it preserves most favorable attributes of degree, but better reflects the role of the nodes in the network and has an increased ability to distinguish between their importance.

On the completeness of the universal knowledge-belief space: A technical note

Meier (2008) shows that the universal knowledge-belief space exists. However, besides the universality there is an other important property might be imposed on knowledge- belief spaces, inherited also from type spaces, the completeness. In this paper we introduce the notion of complete knowledge-belief space, and demonstrate that the universal knowledge-belief space is not complete, that is, some subjective beliefs (probability measures) on the universal knowledge-belief space are not knowledge-belief types.

Incomplete pairwise comparison matrices and weighting methods

A special class of preferences, given by a directed acyclic graph, is considered. They are represented by incomplete pairwise comparison matrices as only partial information is available: for some pairs no comparison is given in the graph. A weighting method satisfies the property linear order preservation if it always results in a ranking such that an alternative directly preferred to another does not have a lower rank. We study whether two procedures, the Eigenvector Method and the Logarithmic Least Squares Method meet this axiom. Both weighting methods break linear order preservation, moreover, the ranking according to the Eigenvector Method depends on the incomplete pairwise comparison representation chosen.

Between plurality and proportionality: an analysis of vote transfer systems

The paper considers a general model of electoral systems combining district-based elections with a compensatory mechanism in order to implement any outcome between strictly majoritarian and purely proportional seat allocation. It contains vote transfer and allows for the application of three different correction formulas. Analysis in a two-party system shows that a trade-off exists for the dominant party between the expected seat share and the chance of obtaining majority. Vote transfer rules are also investigated by focusing on the possibility of manipulation. The model is applied to the 2014 Hungarian parliamentary election. Hypothetical results reveal that the vote transfer rule cannot be evaluated in itself, only together with the share of constituency seats. With an appropriate choice of the latter, the three mechanisms can be made functionally equivalent.

Egységgyöktesztek alkalmazása szezonalitást is tartalmazó idősorok esetében energiatőzsde-adatok példáján

A szezonalitás megfelelő kezelésének kérdése hosszú és rövid távú idősorok esetén egyaránt érdekes feladat. A döntés a determinisztikus vagy sztochasztikus modellezést, illetve annak következményeit illetően hasonló relevanciájúak, mint a determinisztikus és sztochasztikus trend közötti különbségtétel. A szerző tanulmányában ismerteti, hogy milyen módon lehetséges a sztochasztikus trend és szezonalitás tesztelése abban az esetben, amikor azok egymástól nem függetlenek. Az eredményeket európai energiatőzsdék (villamos energia és földgáz) day-ahead (spot) piaci kereskedési adatain mutatja be.