z-logo
open-access-imgOpen Access
Tractable Algorithms for Approximate Nash Equilibria in Generalized Graphical Games with Tree Structure
Author(s) -
Luis E. Ortiz,
Mohammad T. Irfan
Publication year - 2017
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v31i1.10602
Subject(s) - nash equilibrium , bounded function , corollary , tree (set theory) , logarithm , mathematics , combinatorial game theory , scheme (mathematics) , time complexity , best response , constant (computer programming) , polynomial , computer science , combinatorics , discrete mathematics , game theory , mathematical optimization , sequential game , mathematical economics , programming language , mathematical analysis

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom