Rational competitive analysis

Authors:
Moshe Tennenholtz
Affiliations:
Computer Science Department, Stanford University, Stanford, CA
Venue:
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Year:
2001

Citing 5
Cited 4

Competitive paging algorithms

Journal of Algorithms
An optimal on-line algorithm for metrical task system

Journal of the ACM (JACM)
On the k-server conjecture

Journal of the ACM (JACM)
Online computation and competitive analysis

Online computation and competitive analysis
An axiomatic treatment of three qualitative decision criteria

Journal of the ACM (JACM)

Competitive safety analysis

Eighteenth national conference on Artificial intelligence
Equilibrium dynamic systems intelligence

WSEAS Transactions on Information Science and Applications
Equilibrium dynamic systems integration

ICAI'09 Proceedings of the 10th WSEAS international conference on Automation & information
Competitive safety analysis: robust decision-making in multi-agent systems

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Much work in computer science has adopted competitive analysis as a tool for decision making under uncertainty. In this work we extend competitive analysis to the context of multi-agent systems. Unlike classical competitive analysis where the behavior of an agent's environment is taken to be arbitrary, we consider the case where an agent's environment consists of other agents. These agents will usually obey some (minimal) rationality constraints. This leads to the definition of rational competitive analysis. We introduce the concept of rational competitive analysis, and initiate the study of competitive analysis for multi-agent systems. We also discuss the application of rational competitive analysis to the context of bidding games, as well as to the classical oneway trading problem.