Results 1 -
1 of
1
APPROXIMATION IN ALGORITHMIC GAME THEORY: ROBUST APPROXIMATION BOUNDS FOR EQUILIBRIA AND AUCTIONS
"... 1.1. Motivation. Many modern computer science applications involve autonomous, self-interested agents. It is therefore important for us to consider agents ' strategic behavior in modelling the problems, where non-cooperative game theory can be very helpful. Unfortunately, as one can expect, strategi ..."
Abstract
- Add to MetaCart
1.1. Motivation. Many modern computer science applications involve autonomous, self-interested agents. It is therefore important for us to consider agents ' strategic behavior in modelling the problems, where non-cooperative game theory can be very helpful. Unfortunately, as one can expect, strategic behavior of the agents often
