Back to activities
Fondation HEC Montréal seminar

Finite search games with multiple targets

iCalendar

Nov 19, 2018   02:00 PM — 03:00 PM

Thomas Lidbetter Rutgers Business School, United States

We consider a class of zero-sum games played in a finite set of hiding places S. Player I (the Hider) hides some targets in a subset of S of size k, and Player II (the Searcher) searches the locations one-by-one until finding all the targets. The payoff of the game is given by some function f of the set of locations searched up until all the targets have been found. We give a sufficient condition on f for the game to have a simple closed form solution, and we give natural examples of games that satisfy this condition.


Free entrance.
Welcome to everyone!

Georges Zaccour organizer

Location

Université de Montréal
André-Aisenstadt Building
Room 5441
2920, chemin de la Tour Montréal Québec H3T 1J4 Canada

Associated organizations

Research Axis