Faster and Simpler Algorithm for Optimal Strategies of Blotto Game | Zendy

Soheil Behnezhad | Zendy; Sina Dehghani | Zendy; Mahsa Derakhshan | Zendy; MohammadTaghi Hajiaghayi | Zendy; Saeed Seddighin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Faster and Simpler Algorithm for Optimal Strategies of Blotto Game

Author(s) -

Soheil Behnezhad,

Sina Dehghani,

Mahsa Derakhshan,

MohammadTaghi Hajiaghayi,

Saeed Seddighin

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.10620

Subject(s) - polytope , simplex algorithm , battle , computer science , ellipsoid method , mathematical optimization , linear programming , range (aeronautics) , exponential function , stochastic game , extension (predicate logic) , polynomial , time complexity , simplex , mathematics , mathematical economics , algorithm , combinatorics , mathematical analysis , materials science , geometry , archaeology , convex optimization , regular polygon , convex combination , composite material , history , programming language

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