1996
Haimovich, M. . (1996).
Simplex Algorithm Is Very Good!: On the Expected Number of Pivot Steps and Related Properties of Random Linear Programs, The.
Discussion Papers. presented at the 2. Retrieved from
' Publisher's VersionAbstractIn their paper How Good is the Simplex Algorithm?, Klee and Minty exhibited a sequence of linear programs for which the number of pivot steps in the simplex algorithm grows exponentially with the dimensions of the program. We present a probabilistic model in which the expected numberof steps for a variant of the simplex method grows linearly with the dimensions. For programs with parallel pair of inequalities (lower and upper bounds), we present a model in which the expected number of steps from minimum to maximum is d. We also present related results concerning the expected complexity of multi-objective linear programming.
Israeli, E. . (1996).
Sowing Doubt Optimally in Two-Person Repeated Games.
Discussion Papers. presented at the 8, Games and Economic Behavior 28 (1999), 203-216. Retrieved from
/files/dp112.pdf Publisher's VersionAbstractConsider a two-person repeated game (with complete information). Assume that one of the players - say player 1 - has the possibility to sow doubt, in the mind of his opponent, as to what his own (i.e., player 1's) payoffs are. This results in a two-person repeated game with incomplete information. It turns out that, by sowing this kind of doubt, a player can increase his minimal equilibrium payoff in the original game. We prove that this minimum is maximal when only one payoff matrix, which is equal to the negative payoff matrix of the opponent, is added. Thus, it is optimal for a player to make his opponent believe that, with some positive probability, he is playing a zero-sum game. We obtain two formulas for calculating this maximal minimum payoff. Finally, we look at the outcome when both players simultaneously sow doubt in this way.
Okada, A. N., & Daijiro, . (1996).
Strategic Entropy and Complexity in Repeated Games.
Discussion Papers. presented at the 6, Games and Economic Behavior 29 (1999), 191-223. Retrieved from
/files/dp104.pdf Publisher's VersionAbstractWe study repeated two-person zero-sum games in which one of the players has a restricted set of strategies. Restriction is imposed directly on the set of mixed strategies. To this end, we introduce a notion of entropy for mixed strategies as the means of bounding strategies available to a player. We derive a relation between the two types of strategies in terms of entropy. Using this relation together with certain properties of entropy, we show that if the number of repetitions grows faster than the entropy bound, then an unrestricted player can asymptotically hold a restricted player's payoff down to his maximin level in pure actions of the stage game. We consider implications of this result concerning the asymptotic behavior of the value finitely repeated games with finite automata and bounded recall.
Dan S. Felsenthal, M. M. . (1996).
Ternary Voting Games.
Discussion Papers. presented at the 2, International Journal of Game Theory 26 (1997), 335-351. Retrieved from
/files/dp98.pdf Publisher's VersionAbstractWe define ternary voting games (TVGs), a generalization of simple voting games (SVGs). In a play of an SVG each voter has just two options: voting `yes' or `no'. In a TVG a third option is added: abstention. Every SVG can be regarded as a (somewhat degenerate) TVG; but the converse is false. We define appropriate generalizations of the Shapley-Shubik and Banzhaf indices for TVGs. We define also the responsiveness (or degree of democratic participation) of a TVG and determine, for each n, the most responsive TVGs with n voters. We show that these maximally responsive TVGs are more responsive than the corresponding SVGs.
El-Yaniv, R. . (1996).
There Are Infinitely Many Competitive-Optimal Online List Accessing Algorithms.
Discussion Papers. presented at the 6. Retrieved from
' Publisher's VersionAbstractThis paper presents a new family of optimal, 2-competitive, deterministic online list accessing algorithms. This family includes as members the well known MOVE-TO-FRONT (MTF) algorithm, and the recent, more "conservative" algorithm TIMESTAMP due to Albres.
Driessen, T. S. H. . (1996).
Tree Enterprises and Bankruptcy Ventures: A Game-Theoretic Similarity Due to a Graph-Theoretic Proof.
Discussion Papers. presented at the 1, Discrete Applied Mathematics 79 (1997), 105-117. Retrieved from
/files/dp92.pdf Publisher's VersionAbstractIn a tree enterprise, users reside at the nodes of the tree and their aim is to connect themselves, directly or indirectly, to the root of the tree. The construction costs of arcs of the tree are given by means of the arc-cost-function associated with the tree. Face to face with this tree enterprise, the bankruptcy venture is described in terms of the estate of the bankrupt concern and the claims of the various creditors. The objective of the paper is to provide conditions (on the claims and the surplus of the claims in the bankruptcy venture) which are sufficient and necessary for the bankruptcy venture to agree with some tree enterprise. It is established that the bankruptcy venture agrees with some tree enterprise if and only if the surplus of claims in the bankruptcy venture is at most the size of the second smallest claim (in the weak sense). For that purpose, both the tree enterprise as well as the bankruptcy venture are modelled as a cooperative game with transferable utility. Within the framework of cooperative game theory, the proof of the equivalence theorem concerning the tree enterprise game and the bankruptcy game, under the given circumstances, is based on graph theoretic tools in a tree structure.
Yonatan Bilu, Tamar Keasar, U. M., & Shmida, A. . (1996).
When Color Vision Is Not Useful: The Floral Choices of Foraging Bumblebees on Color-Polymorphic Artificial Flowers.
Discussion Papers. presented at the 11, Israel Journal of Plant Sciences 45 (1997), 223-233. Retrieved from
' Publisher's VersionAbstractNaive bumblebees were allowed to forage on 30 color-polymorphic artificial flowers, which were identical in morphology and reward schedule, but were marked by either a human-blue, human-green or a human-white landing surface. The probability of nectar rewards in the artificial flowers, and their spatial distribution, were manipulated experimentally. The bees' color choices in the different experimental treatments were compared. The proportions of visits to the three color morphs deviated significantly from the expected random choice (1/3-1/3-1/3) for more than 50% of the bees. Out of these bees, 38%, 32% and 30% formed a preference for human-blue, human-green and human-white, respectively. The frequency of non-random color choice, and the strength of the deviation from random choice, were highest when the different morphs were placed in separate clusters, lower when they were placed in adjacent clusters, and lowest when they were randomly intermingled. Non-random color choice was also more pronounced when the bees were rewarded according to a constant schedule, rather than probabilistically. A statistically significant preference for human-blue was found during the bees' first three visits. The bees' tendency for "runs" of consecutive visits to the same flower color can partially account for their non-random color choices. The specific color preferences of individuals could not be related to their early foraging experiences.
1995
Feinberg, Y. . (1995).
A Converse to the Agreement Theorem.
Discussion Papers. presented at the 11. Retrieved from
' Publisher's VersionAbstractIn Aumann (1976) - "Agreeing to Disagree" - it is shown that if there is a common prior then common knowledge of disagreement is impossible. This paper studies the converse proposition. The lack of a common prior is shown to yield common knowledge of disagreement in a variety of cases. However, an example demonstrates that this result cannot be generalized.
Risse, M. . (1995).
A Syntactic Model of Forgetting: A Partially Solved Problem.
Discussion Papers. presented at the 6. Retrieved from
' Publisher's VersionAbstractWe look at a set % of states of the world which are defined as maximal consistent lists of formulae formed in a language which contains a knowledge operator ki for each agent i. The states of the world induce an information partition for each agent i such that all those % % % are included in the same information cell which contain the same range of knowledge for this agent (this range of knowledge we will call the agent's ken). We can then ask what it means that some agent i forgets which one of a variety of kens he has. This question can be answered easily if we use states of the world as primitives: then the answer is just to take a union over information cells. This does not make sense any more when states of the world are lists of formulae. We find a solution to this question for the case of one agent and show why the same solution cannot be used for the case of more than one agent. In an appendix, we apply results obtained before to analyze the j-operator (the knowing-whether operator). The larger context in which our question arose was to prove the Bachrach-Cave Agreement-Theorem in a model where states of the world are not primitives.
Daniel Rothenstein, . (1995).
A Two-Period Pollution Safeguards Game with N Operators.
Discussion Papers. presented at the 3. Retrieved from
' Publisher's VersionAbstractThe environmental need to control the quality of the air is represented by a multi-players sequential game. One model is a two period game with n + 1 players, of which n are operators and one is an inspector. The game is analyzed via the solution concept of the strategies equilibrium (Nash equilibrium). The second model assumes that all operators are identical,i.e. the payoffs are the same to all operators. The equations that describe the Nash equilibrium, are solved analytically under this assumption, and enable us to compare games with a different number of operators (n). Numerical solutions are included. A discussion of the advantages and disadvantages of individual punishment vs. collective punishment appears in the last section. The model includes a parameter which varies from full individual punishment when the inspector raises an alarm (i.e. only the operators that acted illegally are fined), to full collective punishment (i.e. all operators are fined regardless their actions). Numerical results are added.
Feinberg, Y. . (1995).
An Incomplete Cooperation Structure for a Voting Game Can Be Stable.
Discussion Papers. presented at the 11, Games and Economic Behavior 24 (1998), 2-9. Retrieved from
/files/dp85.pdf Publisher's VersionAbstractAumann and Myerson (1988) defined a linking game leading to the formation of cooperation structures. They asked whether it is possible for a simple game to have a stable structure in which no coalition forms, i.e., in which the cooperation graph is not internally complete. We answer this question affirmatively; specifically, we present a simple proper weighted majority game with a connected incomplete structure, and prove it to be stable.
Mas-Colell, S. H., & Andreu, . (1995).
Bargaining and Value.
Discussion Papers. presented at the 1, Econometrica 64 (1996), 357-380. Retrieved from
/files/ nbarg.html Publisher's VersionAbstractWe present and analyze a model of non-cooperative bargaining among n participants, applied to situations describable as games in coalitional form. This leads to a unified theory that has as special cases the Shapley value in the transferable utility case, the Nash bargaining solution in the pure bargaining case, and the recently introduced Maschler-Owen consistent value solution in the general (non-transferable utility) case.
Neyman, A. . (1995).
Cooperation in the Repeated Prisoners' Dilemma When the Number of Stages Is Not Commonly Known.
Discussion Papers. presented at the 1, (revised indp #162). Retrieved from
' Publisher's VersionAbstractIt has often been observed that cooperative behavior emerges in actual play of the repeated prisoners' dilemma. This observation seems to be in conflict with the fact that, in any finite repetition of the prisoners' dilemma, all Nash equilibria (and even all correlated equilibria) lead to the non-cooperative outcome in each stage. In this paper we show that a very small departure from the common knowledge assumption on the number, T, of repetitions already enables cooperation. More generally, with such a departure, any feasible individually-rational outcome of any one-shot game can be approximated by a Nash equilibrium of a finitely-repeated version of that game. The sense in which the departure from common knowledge is "small" is as follows: (i) With probability one, the players know T with precision +- 1. (ii) With probability 1 - %, the players know T precisely; moreover, this knowledge is mutual to degree %T. (iii) the deviation of T from its expectation is extremely small.
Neyman, A. . (1995).
Cooperation, Repetition and Automata.
Discussion Papers. presented at the 11, In S. Hart & A. Mas-Colell (eds.), Cooperation: Game-Theoretic Approaches, (1995) Springer-Verlag 233-255. Retrieved from
' Publisher's VersionAbstractThis chapter studies the implications of bounding the complexity of players' strategies in long term interactions. The complexity of a strategy is measured by the size of the minimal automaton that can implement it. A finite automaton has a finite number of states and an initial state. It prescribes the action to be taken as a function of the current state and its next state is a function of its current state and the actions of the other players. The size of an automaton is its number of states. The results study the equilibrium payoffs per stage of the repeated games when players' strategies are restricted to those implementable by automata of bounded size.
James A. Sundali, A. R., & Seale, D. A. . (1995).
Coordination in Market Entry Games with Symmetric Players.
Discussion Papers. presented at the 3, Organizational Behavior and Human Decision Processes 64 (1995), 203-218. Retrieved from
/files/dp72.pdf Publisher's VersionAbstractWe report the results of two experiments designed to study tacit coordination in a class of market entry games with linear payoff functions, binary decisions, and zero entry costs, in which each of n = 20 players must decide on each trial whether or not to enter a market whose capacity is public knowledge. The results show that although the subjects differ considerably from one another in their decision policies, tacit coordination emerges quickly on the aggregate level and is accounted for most successfully by the Nash equilibrium solution for noncooperative n-person games.
Neyman, A. . (1995).
Correlated Equilibrium and Potential Games.
Discussion Papers. presented at the 7, International Journal of Game Theory 26 (1997), 223-227. Retrieved from
' Publisher's VersionAbstractAny correlated equilibrium of a strategic game with bounded payoffs and convex strategy sets which has a smooth concave potential, is a mixture of pure strategy Nash equilibrium. If moreover, the strategy sets are compact and the potential is strictly concave, then the game has a unique correlated equilibrium.
Sorin, A. N., & Sylvain, . (1995).
Equilibria in Repeated Games of Incomplete Information: The Deterministic Symmetric Case.
Discussion Papers. presented at the 7, In T. Parthasaraty Et Al. (eds.) Game-Theoretic Applications to Economics and Operations Research ( ) Kluwer Academic Press. Retrieved from
' Publisher's VersionAbstractEvery two person game of incomplete information in which the information to both players is identical and deterministic has an equilibrium.
Sorin, A. N., & Sylvain, . (1995).
Equilibria in Repeated Games of Incomplete Information: The General Symmetric Case.
Discussion Papers. presented at the 11, International Journal of Game Theory 27 (1998), 201-210. Retrieved from
/files/dp86.pdf Publisher's VersionAbstractEvery two person repeated game of symmetric incomplete information in which the signals sent at each stage to both players are identical and generated by a state and moves dependent probability distribution on a given finite alphabet has an equilibrium payoff.
Amnon Rapoport, D. A. S., & Sundali, J. A. . (1995).
Equilibrium Play in Large Group Market Entry Games.
Discussion Papers. presented at the 3, Management Science 44 (1998), 119-141. Retrieved from
' Publisher's VersionAbstractCoordination behavior is studies experimentally in a class of market entry games featuring symmetric players, complete information, zero entry costs, and several randomly presented values of the market capacity. Once the market capacity, c, becomes common knowledge, each player must decide privately whether to enter the market and receive a payoff which increases in the difference between c and the number of entrants, m, or stay out. Payoffs forstaying out are either positive, giving rise to the domain of gains, or negative, giving rise to the domain of losses. The major findings are substantial individual differences in decision policies, which do not diminish with practice, and aggregate group behavior which is organized extremely well in both the domains of gains and loses by the Nash equilibrium solution.
Neyman, A. . (1995).
Finitely Repeated Games with Finite Automata.
Discussion Papers. presented at the 6, (revised indp #161). Retrieved from
/files/dp69.pdf Publisher's VersionAbstract{The paper studies the implication of bounding the complexity of the strategies players may select on the set of equilibrium payoffs in repeated games. The complexity of a strategy is measured by the size of the minimal automaton that can implement it. A finite automaton is an automated machine that implements a strategy; it has a finite number of states and an initial state. It prescribes the action to be taken as a function of the current state and a transition function changing the states of the automaton as a function of its current state and the present actions of the other players. The size of an automaton is its number of states. The Main results imply in particular that in two person repeated games, the equilibrium payoffs of a sequence of such games, G(n)