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

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

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

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

Multi-Agent Influence Diagrams (MAIDs) are a compact modelling language for representing game theoretic settings.

Game-theoretic axioms for local rationality and bounded knowledge

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

This Provisional PDF corresponds to the article as it appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. Nanoscale molecular communication networks: a game-theoretic perspective

Abstract. Algorithmic mechanism design is an important area between computer science and economics. One of the most fundamental problems in this area is the problem of scheduling unrelated machines to minimize the makespan. The machines behave like selfish players: they have to get paid in order to process the tasks, and would lie about their processing times if they could increase their utility in this way. The problem was proposed and studied in the seminal paper of Nisan and Ronen, where it was shown that the approximation ratio of mechanisms is between 2 and n. In this thesis, we present some recent improvements of the lower bound to

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