6,190 research outputs found

    The Incorrect Usage of Propositional Logic in Game Theory: The Case of Disproving Oneself

    Get PDF
    Recently, we had to realize that more and more game theoretical articles have been published in peer-reviewed journals with severe logical deficiencies. In particular, we observed that the indirect proof was not applied correctly. These authors confuse between statements of propositional logic. They apply an indirect proof while assuming a prerequisite in order to get a contradiction. For instance, to find out that "if A then B" is valid, they suppose that the assumptions "A and not B" are valid to derive a contradiction in order to deduce "if A then B". Hence, they want to establish the equivalent proposition "A and not B implies A and not A" to conclude that "if A then B" is valid. In fact, they prove that a truth implies a falsehood, which is a wrong statement. As a consequence, "if A then B" is invalid, disproving their own results. We present and discuss some selected cases from the literature with severe logical flaws, invalidating the articles.Comment: 16 pages, 2 table

    Pure Nash Equilibria: Hard and Easy Games

    Full text link
    We investigate complexity issues related to pure Nash equilibria of strategic games. We show that, even in very restrictive settings, determining whether a game has a pure Nash Equilibrium is NP-hard, while deciding whether a game has a strong Nash equilibrium is SigmaP2-complete. We then study practically relevant restrictions that lower the complexity. In particular, we are interested in quantitative and qualitative restrictions of the way each players payoff depends on moves of other players. We say that a game has small neighborhood if the utility function for each player depends only on (the actions of) a logarithmically small number of other players. The dependency structure of a game G can be expressed by a graph DG(G) or by a hypergraph H(G). By relating Nash equilibrium problems to constraint satisfaction problems (CSPs), we show that if G has small neighborhood and if H(G) has bounded hypertree width (or if DG(G) has bounded treewidth), then finding pure Nash and Pareto equilibria is feasible in polynomial time. If the game is graphical, then these problems are LOGCFL-complete and thus in the class NC2 of highly parallelizable problems

    Competitive Outcomes and the Inner Core of NTU Market Games

    Get PDF
    We consider the inner core as a solution concept for cooperative games with non-transferable utility (NTU) and its relationship to competitive equilibria of markets that are induced by an NTU game. We investigate the relationship between certain subsets of the inner core for NTU market games and competitive payoff vectors of markets linked to the NTU market game. This can be considered as the case in between the two extreme cases of Qin (1993). We extend the results of Qin (1993) to a large class of closed subsets of the inner core: Given an NTU market game we construct a market depending on a given closed subset of its inner core. This market represents the game and further has the given set as the set of payoffs of competitive equilibria. It turns out that this market is not determined uniquely and thus we obtain a class of markets with the desired property.Market Games, Competitive Payoffs, Inner Core

    Sequential legislative lobbying

    Get PDF
    In this paper, we analyze the equilibrium of a sequential game-theoretical model of lobbying, due to Groseclose and Snyder (1996), describing a legislature that vote over two alternatives, where two opposing lobbies, Lobby 0 and Lobby 1, compete by bidding for legislators’ votes. In this model, the lobbyist moving first suffers from a second mover advantage and will make an offer to a panel of legislators only if it deters any credible counter-reaction from his opponent, i.e., if he anticipates to win the battle. This paper departs from the existing literature in assuming that legislators care about the consequence of their votes rather than their votes per se. Our main focus is on the calculation of the smallest budget that he needs to win the game and on the distribution of this budget across the legislators. We study the impact of the key parameters of the game on these two variables and show the connection of this problem with the combinatorics of sets and notions from cooperative game theory.Lobbying; cooperative games; noncooperative games

    Stability and fairness in models with a multiple membership

    Get PDF
    This article studies a model of coalition formation for the joint production (and finance) of public projects, in which agents may belong to multiple coalitions. We show that, if projects are divisible, there always exists a stable (secession-proof) structure, i.e., a structure in which no coalition would reject a proposed arrangement. When projects are in- divisible, stable allocations may fail to exist and, for those cases, we resort to the least core in order to estimate the degree of instability. We also examine the compatibility of stability and fairness on metric environments with indivisible projects. To do so, we explore, among other things, the performance of several well-known solutions (such as the Shapley value, the nucleolus, or the Dutta-Ray value) in these environments.stability, fairness, membership, coalition formation

    Repeated games for eikonal equations, integral curvature flows and non-linear parabolic integro-differential equations

    Full text link
    The main purpose of this paper is to approximate several non-local evolution equations by zero-sum repeated games in the spirit of the previous works of Kohn and the second author (2006 and 2009): general fully non-linear parabolic integro-differential equations on the one hand, and the integral curvature flow of an interface (Imbert, 2008) on the other hand. In order to do so, we start by constructing such a game for eikonal equations whose speed has a non-constant sign. This provides a (discrete) deterministic control interpretation of these evolution equations. In all our games, two players choose positions successively, and their final payoff is determined by their positions and additional parameters of choice. Because of the non-locality of the problems approximated, by contrast with local problems, their choices have to "collect" information far from their current position. For integral curvature flows, players choose hypersurfaces in the whole space and positions on these hypersurfaces. For parabolic integro-differential equations, players choose smooth functions on the whole space

    Nested identification of subjective probabilities

    Get PDF
    The theory of games against nature relies on complete preferences among all conceivable acts, i.e. among all potential assignments of consequeces to states of nature (case 1). Yet most decision problems call for choosing an element from a limited set of acts. And in games of strategy, the set of strategies available to a player is givent and not amenable to artificial extensions. In “Assessing Strategic Risk”,(ECON DP 2005-20) R.J. Aumann and J.H. Drèze extend the basic result of decision theory (maximisation of subjectvely expected utility) to situations where preferences are defined only for a given set of acts, and for lotteries among these and sure consequences (case 2). In this paper, we provide a similar extension for two other situations : those where only the set of optimal elements from a given set of acts is known (case 3); and those where only a single optimal act is known (case 4). To these four cases correspond four nested sets of admissible subjective probabilities over the states or the opponent’s strategies, namely a singleton in case 1 and increasing sets in cases 2-4. The results for case 3 and 4 also define the extent to which subjective probabilities must be specified in order to solve a given decision problem or play a given name.
    • …
    corecore