Rendezvous on the Line with Different Speeds and Markers that can be Dropped at Chosen Time

09/02/2021
by   Pierre Leone, et al.
0

In this paper we introduce a Linear Program (LP) based formulation of a Rendezvous game with markers on the infinite line and solve it. In this game one player moves at unit speed while the second player moves at a speed bounded by vmax smaller than 1. We observe that in this setting a slow moving player may have interest to rest still instead of moving. This shows that in some conditions the wait-for-mummy strategy is optimal. We observe as well that the strategies are completely different if the player that holds the marker is the fast or slow one. Interestingly, the marker is not useful when the player without marker moves slowly, i.e. the fast moving player holds the marker.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/03/2020

At Most 43 Moves, At Least 29: Optimal Strategies and Bounds for Ultimate Tic-Tac-Toe

Ultimate Tic-Tac-Toe is a variant of the well known tic-tac-toe (noughts...
research
08/27/2020

A competitive search game with a moving target

We introduce a discrete-time search game, in which two players compete t...
research
12/04/2017

Time-Space Tradeoffs for the Memory Game

A single-player Memory Game is played with n distinct pairs of cards, wi...
research
01/25/2013

Identifying Playerś Strategies in No Limit Texas Holdém Poker through the Analysis of Individual Moves

The development of competitive artificial Poker playing agents has prove...
research
01/13/2023

Primal-Dual Cops and Robber

Cops and Robber is a family of two-player games played on graphs in whic...
research
07/17/2020

Escaping a Polygon

Suppose an "escaping" player moves continuously at maximum speed 1 in th...
research
04/25/2021

The connection between the PQ penny flip game and the dihedral groups

This paper is inspired by the PQ penny flip game. It employs group-theor...

Please sign up or login with your details

Forgot password? Click here to reset