Efficient learning equilibrium

@misc{citeulike:574962, abstract = {We introduce efficient learning equilibrium (ELE), a normative approach to learning in non cooperative settings. In ELE, the learning algorithms themselves are required to be in equilibrium. In addition, the learning algorithms arrive at a desired value after polynomial time, and deviations from a prescribed ELE become irrational after polynomial time. We prove the existence of an ELE in the perfect monitoring setting, where the desired value is the expected payoff in a Nash equilibrium. We...}, author = {Brafman, R. and Tennenholtz, M. }, citeulike-article-id = {574962}, posted-at = {2006-04-04 01:36:56}, priority = {2}, title = {Efficient learning equilibrium}, url = {http://citeseer.ist.psu.edu/brafman02efficient.html}, year = {2004} }

TY - GEN ID - citeulike:574962 L3 - citeulike-article-id:574962 TI - Efficient learning equilibrium N2 - We introduce efficient learning equilibrium (ELE), a normative approach to learning in non cooperative settings. In ELE, the learning algorithms themselves are required to be in equilibrium. In addition, the learning algorithms arrive at a desired value after polynomial time, and deviations from a prescribed ELE become irrational after polynomial time. We prove the existence of an ELE in the perfect monitoring setting, where the desired value is the expected payoff in a Nash equilibrium. We... AU - Brafman, R AU - Tennenholtz, M PY - 2004/// UR - http://citeseer.ist.psu.edu/brafman02efficient.html ER -