Optimal strategies for the one-round discrete Voronoi game on a line

Author： Banik Aritra   Bhattacharya Bhaswar   Das Sandip  

Publisher： Springer Publishing Company

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.26, Iss.4, 2013-11, pp. : 655-669

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

How to Win at (One-Round) War

By  

The College Mathematics Journal, Vol. 46, Iss. 4, 2015-09 ,pp. : 242-253

Mathematical Association of America

Access to resources Recommend Favorite

Pareto-Optimal Security Strategies as Minimax Strategies of a Standard Matrix Game

By Voorneveld M.  

Journal of Optimization Theory and Applications, Vol. 102, Iss. 1, 1999-07 ,pp. : 203-210

Springer Publishing Company

Access to resources Recommend Favorite

Optimal Defensive Strategies in One-Dimensional RISK

By  

Mathematics Magazine, Vol. 88, Iss. 3, 2015-01 ,pp. : 217-230

Mathematical Association of America

Access to resources Recommend Favorite

Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures

By Martin Keith  

Cryptography and Communications, Vol. 3, Iss. 2, 2011-06 ,pp. : 65-86

Springer Publishing Company

Access to resources Recommend Favorite

A practical strongly secure one‐round authenticated key exchange protocol without random oracles

By  

SECURITY AND COMMUNICATION NETWORKS (ELECTRONIC), Vol. 8, Iss. 6, 2015-04 ,pp. : 1118-1131

John Wiley & Sons Inc

Access to resources Recommend Favorite