Results 1 - 10 of 1,578

The Accrual Anomaly in the Game-Theoretic Setting

by Khrystyna Bochkay, Academic Adviser Glenn Shafer
"... This paper proposes an alternative analysis of the accrual anomaly. It checks whether the accrual anomaly documented by Sloan (1996) exists in the game-theoretic setting. The game-theoretic tests identify the accrual anomaly in the following sense: a trading strategy that is based on the accrual com ..."
Abstract - Add to MetaCart
This paper proposes an alternative analysis of the accrual anomaly. It checks whether the accrual anomaly documented by Sloan (1996) exists in the game-theoretic setting. The game-theoretic tests identify the accrual anomaly in the following sense: a trading strategy that is based on the accrual

Communicating agents in a game-theoretic setting

by Andreas Witzel, Krzysztof R. Apt, Jonathan A. Zvesper , 2009
"... We study the consequences of thruthful communication among agents in a game-theoretic setting. To this end we consider strategic games in the presence of an interaction structure, which specifies groups of players who can communicate their preferences with each other, assuming that initially each pl ..."
Abstract - Add to MetaCart
We study the consequences of thruthful communication among agents in a game-theoretic setting. To this end we consider strategic games in the presence of an interaction structure, which specifies groups of players who can communicate their preferences with each other, assuming that initially each

Quantal Response Equilibria For Normal Form Games

by Richard D. McKelvey, Thomas R. Palfrey - NORMAL FORM GAMES, GAMES AND ECONOMIC BEHAVIOR , 1995
"... We investigate the use of standard statistical models for quantal choice in a game theoretic setting. Players choose strategies based on relative expected utility, and assume other players do so as well. We define a Quantal Response Equilibrium (QRE) as a fixed point of this process, and establish e ..."
Abstract - Cited by 647 (28 self) - Add to MetaCart
We investigate the use of standard statistical models for quantal choice in a game theoretic setting. Players choose strategies based on relative expected utility, and assume other players do so as well. We define a Quantal Response Equilibrium (QRE) as a fixed point of this process, and establish

Maximizing the Spread of Influence Through a Social Network

by David Kempe - In KDD , 2003
"... Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technological innovations, the sudden and widespread adoption of various strategies in game-theoretic settings, and the effects of ..."
Abstract - Cited by 990 (7 self) - Add to MetaCart
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technological innovations, the sudden and widespread adoption of various strategies in game-theoretic settings, and the effects

Putting MAIDs in Context

by Mark Crowley Department
"... Multi-Agent Influence Diagrams (MAIDs) are a compact modelling language for representing game theoretic settings. ..."
Abstract - Add to MetaCart
Multi-Agent Influence Diagrams (MAIDs) are a compact modelling language for representing game theoretic settings.

On Game-Theoretic Models of Networks

by Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov - SPRINGER-VERLAG BERLIN HEIDELBERG , 2001
"... In this paper, we study the complexity of deciding which player has a winning strategy in certain types of McNaughton games. These graph games can be used as models for computational problems and processes of infinite duration. We consider the cases (1) where the first player wins when vertices in ..."
Abstract - Cited by 3 (3 self) - Add to MetaCart
In this paper, we study the complexity of deciding which player has a winning strategy in certain types of McNaughton games. These graph games can be used as models for computational problems and processes of infinite duration. We consider the cases (1) where the first player wins when vertices

Efficient MAC in Cognitive Radio Systems: A Game-Theoretic Approach

by Márk Félegyházi, Jean-pierre Hubaux
"... Abstract—In this paper, we study the problem of efficient medium access control (MAC) among cognitive radio devices that are equipped with multiple radios and thus are capable of transmitting simultaneously at different frequencies (channels). We assume that radios contend on each channel using the ..."
Abstract - Cited by 8 (0 self) - Add to MetaCart
the Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. We study two MAC problems: (i) the allocation of the available channels among radios, and (ii) the optimal usage of each allocated channel by the radios occupying it. Both problems are studied in a game-theoretic setting, where

Ad hoc-VCG: A truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents

by Luzi Anderegg, Stephan Eidenbenz , 2003
"... We introduce a game-theoretic setting for routing in a mobile ad hoc network that consists of greedy, selfish agents who accept payments for forwarding data for other agents if the payments cover their individual costs incurred by forwarding data. In this setting, we propose Ad hoc-VCG, a reactive r ..."
Abstract - Cited by 234 (8 self) - Add to MetaCart
We introduce a game-theoretic setting for routing in a mobile ad hoc network that consists of greedy, selfish agents who accept payments for forwarding data for other agents if the payments cover their individual costs incurred by forwarding data. In this setting, we propose Ad hoc-VCG, a reactive

Practical Issues in Temporal Difference Learning

by Gerald Tesauro - Machine Learning , 1992
"... This paper examines whether temporal difference methods for training connectionist networks, such as Suttons's TD(lambda) algorithm can be successfully applied to complex real-world problems. A number of important practical issues are identified and discussed from a general theoretical perspect ..."
Abstract - Cited by 415 (2 self) - Add to MetaCart
built in, the network is able to learn from scratch to play the entire game at a fairly strong intermediate level of performance which is clearly better than conventional commercial programs and which in fact surpasses comparable networks trained on a massive human expert data set. This indicates

Game-theoretic agent programming in Golog

by Alberto Finzi, Thomas Lukasiewicz - Proceedings ECAI-2004 , 2004
"... We present the agent programming language GTGolog, which integrates explicit agent programming in Golog with game-theoretic multi-agent planning in Markov games. It is a generalization of DTGolog to a multi-agent setting, where we have two competing single agents or two competing teams of agents. ..."
Abstract - Cited by 8 (6 self) - Add to MetaCart
We present the agent programming language GTGolog, which integrates explicit agent programming in Golog with game-theoretic multi-agent planning in Markov games. It is a generalization of DTGolog to a multi-agent setting, where we have two competing single agents or two competing teams of agents
Results 1 - 10 of 1,578