Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Raffaello Carosi, Michele Flammini, Gianpiero Monaco. Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games. In Kate Larson, Michael Winikoff, Sanmay Das, Edmund Durfee, editors, Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2017, São Paulo, Brazil, May 8-12, 2017. pages 911-919, ACM, 2017. [doi]

This author has not been identified. Look up 'Raffaello Carosi' in GoogleThis author has not been identified. Look up 'Michele Flammini' in GoogleThis author has not been identified. Look up 'Gianpiero Monaco' in Google

runs on WebDSL