English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper we introduce novel algorithmic strategies for effcientlyplaying two-player games in which the players have different or identicalplayer roles. In the case of identical roles, the players compete for the sameobjective (that of winning the game). The case with different player rolesassumes that one of the players asks questions in order to identify a secretpattern and the other one answers them. The purpose of the first player is toask as few questions as possible (or that the questions and their numbersatisfy some previously known constraints) and the purpose of the secret playeris to answer the questions in a way that will maximize the number of questionsasked by the first player (or in a way which forces the first player to breakthe constraints of the game). We consider both previously known games (orextensions of theirs) and new types of games, introduced in this paper.

Efficient Online Algorithmic Strategies for Several Two-Player Games with Different or Identical Player Roles