23,825 research outputs found
Unawareness in Dynamic Psychological Games
Building on Battigalli and Dufwenberg (2009)'s framework of dynamic psychological games and the recent progress in the modeling of dynamic unawareness, we provide a general framework that allows for `unawareness' in the strategic interaction of players motivated by belief-dependent psychological preferences like reciprocity and guilt. We show that unawareness has a pervasive impact on the strategic interaction of psychologically motivated players. Intuitively, unawareness influences players' beliefs concerning, for example, the intentions and expectations of others which in turn impacts their behavior. Moreover, we highlight the strategic role of communication concerning feasible paths of play in these environments.unawareness; extensive-form games; communication; belief-dependent preferences; sequential equilibrium
A Formal Separation Between Strategic and Nonstrategic Behavior
It is common in multiagent systems to make a distinction between "strategic"
behavior and other forms of intentional but "nonstrategic" behavior: typically,
that strategic agents model other agents while nonstrategic agents do not.
However, a crisp boundary between these concepts has proven elusive. This
problem is pervasive throughout the game theoretic literature on bounded
rationality and particularly critical in parts of the behavioral game theory
literature that make an explicit distinction between the behavior of
"nonstrategic" level-0 agents and "strategic" higher-level agents (e.g., the
level-k and cognitive hierarchy models). Overall, work discussing bounded
rationality rarely gives clear guidance on how the rationality of nonstrategic
agents must be bounded, instead typically just singling out specific decision
rules and informally asserting them to be nonstrategic (e.g., truthfully
revealing private information; randomizing uniformly). In this work, we propose
a new, formal characterization of nonstrategic behavior. Our main contribution
is to show that it satisfies two properties: (1) it is general enough to
capture all purportedly "nonstrategic" decision rules of which we are aware in
the behavioral game theory literature; (2) behavior that obeys our
characterization is distinct from strategic behavior in a precise sense
Introducing Hierarchy in Energy Games
In this work we introduce hierarchy in wireless networks that can be modeled
by a decentralized multiple access channel and for which energy-efficiency is
the main performance index. In these networks users are free to choose their
power control strategy to selfishly maximize their energy-efficiency.
Specifically, we introduce hierarchy in two different ways: 1. Assuming
single-user decoding at the receiver, we investigate a Stackelberg formulation
of the game where one user is the leader whereas the other users are assumed to
be able to react to the leader's decisions; 2. Assuming neither leader nor
followers among the users, we introduce hierarchy by assuming successive
interference cancellation at the receiver. It is shown that introducing a
certain degree of hierarchy in non-cooperative power control games not only
improves the individual energy efficiency of all the users but can also be a
way of insuring the existence of a non-saturated equilibrium and reaching a
desired trade-off between the global network performance at the equilibrium and
the requested amount of signaling. In this respect, the way of measuring the
global performance of an energy-efficient network is shown to be a critical
issue.Comment: Accepted for publication in IEEE Trans. on Wireless Communication
Supply chains : ago-antagonistic systems through co-opetition game theory lens
Supply chain configurations, as hybrid governance structures, allow companies to be sufficiently integrated while keeping a certain level of flexibility. This enables them, on one hand, to converge towards common interests through the development of cooperation; and on the other hand, to diverge on their own interests by remaining in competition. This dynamics generates an ago-antagonistic system where both of these two concepts, namely cooperation and competition, simultaneously drive the supply chain. In the present article, this system is analyzed by using the co-opetition game theory developed by Brandenburger and Nalebuff (1996) in order to highlight the importance of such an apprehension of the supply chain approach.Supply chain; cooperation; competition; ago-antagonistic approach; co-opetition game theory
Game theory of mind
This paper introduces a model of âtheory of mindâ, namely, how we represent the intentions and goals of others to optimise our mutual interactions. We draw on ideas from optimum control and game theory to provide a âgame theory of mindâ. First, we consider the representations of goals in terms of value functions that are prescribed by utility or rewards. Critically, the joint value functions and ensuing behaviour are optimised recursively, under the assumption that I represent your value function, your representation of mine, your representation of my representation of yours, and so on ad infinitum. However, if we assume that the degree of recursion is bounded, then players need to estimate the opponent's degree of recursion (i.e., sophistication) to respond optimally. This induces a problem of inferring the opponent's sophistication, given behavioural exchanges. We show it is possible to deduce whether players make inferences about each other and quantify their sophistication on the basis of choices in sequential games. This rests on comparing generative models of choices with, and without, inference. Model comparison is demonstrated using simulated and real data from a âstag-huntâ. Finally, we note that exactly the same sophisticated behaviour can be achieved by optimising the utility function itself (through prosocial utility), producing unsophisticated but apparently altruistic agents. This may be relevant ethologically in hierarchal game theory and coevolution
Recommended from our members
Chris Cannings: A Life in Games
Chris Cannings was one of the pioneers of evolutionary game theory. His early work was inspired by the formulations of John Maynard Smith, Geoff Parker and Geoff Price; Chris recognized the need for a strong mathematical foundation both to validate stated results and to give a basis for extensions of the models. He was responsible for fundamental results on matrix games, as well as much of the theory of the important war of attrition game, patterns of evolutionarily stable strategies, multiplayer games and games on networks. In this paper we describe his work, key insights and their influence on research by others in this increasingly important field. Chris made substantial contributions to other areas such as population genetics and segregation analysis, but it was to games that he always returned. This review is written by three of his students from different stages of his career
A Repeated Game Formulation of Energy-Efficient Decentralized Power Control
Decentralized multiple access channels where each transmitter wants to
selfishly maximize his transmission energy-efficiency are considered.
Transmitters are assumed to choose freely their power control policy and
interact (through multiuser interference) several times. It is shown that the
corresponding conflict of interest can have a predictable outcome, namely a
finitely or discounted repeated game equilibrium. Remarkably, it is shown that
this equilibrium is Pareto-efficient under reasonable sufficient conditions and
the corresponding decentralized power control policies can be implemented under
realistic information assumptions: only individual channel state information
and a public signal are required to implement the equilibrium strategies.
Explicit equilibrium conditions are derived in terms of minimum number of game
stages or maximum discount factor. Both analytical and simulation results are
provided to compare the performance of the proposed power control policies with
those already existing and exploiting the same information assumptions namely,
those derived for the one-shot and Stackelberg games.Comment: 25 pages, 5 figures, accepted for publication in IEEE Transaction on
Wireless Communicatio
- âŠ