English
Related papers

Related papers: A competitive search game with a moving target

200 papers

This paper considers the theoretical, computational, and econometric properties of continuous time dynamic discrete choice games with stochastically sequential moves, introduced by Arcidiacono, Bayer, Blevins, and Ellickson (2016). We…

Econometrics · Economics 2025-11-05 Jason R. Blevins

In many multi-player interactions, players incur strictly positive costs each time they execute actions e.g. 'menu costs' or transaction costs in financial systems. Since acting at each available opportunity would accumulate prohibitively…

Multiagent Systems · Computer Science 2024-08-02 David Mguni

This study optimises manually derived rule-based expert system classification of objects according to changes in their properties over time. One of the key challenges that this study tries to address is how to classify objects that exhibit…

Artificial Intelligence · Computer Science 2016-07-21 Polla Fattah , Uwe Aickelin , Christian Wagner

In a two-player zero-sum graph game, the players move a token throughout a graph to produce an infinite play, which determines the winner of the game. Bidding games are graph games in which in each turn, an auction (bidding) determines…

Formal Languages and Automata Theory · Computer Science 2025-07-02 Guy Avni , Suman Sadhukhan

Probabilistic timed automata are a suitable formalism to model systems with real-time, nondeterministic and probabilistic behaviour. We study two-player zero-sum games on such automata where the objective of the game is specified as the…

Logic in Computer Science · Computer Science 2016-04-18 Vojtěch Forejt , Marta Kwiatkowska , Gethin Norman , Ashutosh Trivedi

Semi-Markov model is one of the most general models for stochastic dynamic systems. This paper deals with a two-person zero-sum game for semi-Markov processes. We focus on the expected discounted payoff criterion with state-action-dependent…

Computer Science and Game Theory · Computer Science 2021-03-09 Zhihui Yu , Xianping Guo , Li Xia

We examine the problem of the existence of optimal deterministic stationary strategiesintwo-players antagonistic (zero-sum) perfect information stochastic games with finitely many states and actions.We show that the existenceof such…

Computer Science and Game Theory · Computer Science 2016-11-28 Hugo Gimbert , Wieslaw Zielonka

We study two-player security games which can be viewed as sequences of nonzero-sum matrix games played by an Attacker and a Defender. The evolution of the game is based on a stochastic fictitious play process. Players do not have access to…

Computer Science and Game Theory · Computer Science 2010-03-16 Kien C. Nguyen , Tansu Alpcan , Tamer Basar

A multi-player competitive Dynkin stopping game is constructed. Each player can either exit the game for a fixed payoff, determined a priori, or stay and receive an adjusted payoff depending on the decision of other players. The single…

Computer Science and Game Theory · Computer Science 2012-11-20 Ivan Guo

This paper considers a formulation of a differential game with constrained dynamics, where one player selects the dynamics and the other selects the applicable cost. When the game is considered on a finite time horizon, its value satisfies…

Optimization and Control · Mathematics 2009-09-25 Rami Atar , Paul Dupuis

We study a class of two-player zero-sum stochastic games known as \textit{blind stochastic games}, where players neither observe the state nor receive any information about it during the game. A central concept for analyzing long-duration…

Optimization and Control · Mathematics 2025-11-24 Krishnendu Chatterjee , David Lurie , Raimundo Saona , Bruno Ziliotto

Priced timed games are optimal-cost reachability games played between two players---the controller and the environment---by moving a token along the edges of infinite graphs of configurations of priced timed automata. The goal of the…

Logic in Computer Science · Computer Science 2015-07-22 Shibashis Guha , Shankara Narayanan Krishna , Lakshmi Manasa , Ashutosh Trivedi

We study the classic divide-and-choose method for equitably allocating divisible goods between two players who are rational, self-interested Bayesian agents. The players have additive values for the goods. The prior distributions on those…

Computer Science and Game Theory · Computer Science 2024-10-22 Jamie Tucker-Foltz , Richard Zeckhauser

We conduct a comprehensive analysis of the discrete-time exponential-weights dynamic with a constant step size on all general-sum and symmetric $2 \times 2$ normal-form games, i.e. games with $2$ pure strategies per player, and where the…

Computer Science and Game Theory · Computer Science 2026-01-22 Guanghui Wang , Krishna Acharya , Lokranjan Lakshmikanthan , Juba Ziani , Vidya Muthukumar

We study a finite-horizon differential game of pursuit-evasion like, between a single player and a mass of agents. The player and the mass directly control their own evolution, which for the mass is given by a first order PDE of transport…

Optimization and Control · Mathematics 2025-02-28 Fabio Bagagiolo , Rossana Capuani , Luciano Marzufero

In team-based invasion sports such as soccer and basketball, analytics is important for teams to understand their performance and for audiences to understand matches better. The present work focuses on performing visual analytics to…

Artificial Intelligence · Computer Science 2019-07-03 Kun Zhao , Takayuki Osogami , Tetsuro Morimura

Sponsored search is an important monetization channel for search engines, in which an auction mechanism is used to select the ads shown to users and determine the prices charged from advertisers. There have been several pieces of work in…

Computer Science and Game Theory · Computer Science 2014-06-05 Di He , Wei Chen , Liwei Wang , Tie-Yan Liu

This paper considers a two-person zero-sum continuous-time Markov pure jump game in Borel state and action spaces over a fixed finite horizon. The main assumption on the model is the existence of a drift function, which bounds the reward…

Optimization and Control · Mathematics 2017-03-31 Xin Guo , Yi Zhang

We consider a zero-sum continuous time stopping game in which the pay-off is revealed in the maximum of the two stopping times instead of the minimum, which is the case in Dynkin games.

Probability · Mathematics 2015-07-28 Erhan Bayraktar , Zhou Zhou

In many problem settings, most notably in game playing, an agent receives a possibly delayed reward for its actions. Often, those rewards are handcrafted and not naturally given. Even simple terminal-only rewards, like winning equals 1 and…

Artificial Intelligence · Computer Science 2020-12-09 Tobias Joppen , Johannes Fürnkranz
‹ Prev 1 3 4 5 6 7 10 Next ›