Related papers: Maximizing the Score in "Ticket to Ride"
Ubiquitous mobile computing have enabled ride-hailing services to collect vast amounts of behavioral data of riders and drivers and optimize supply and demand matching in real time. While these mobility service providers have some degree of…
We consider ride-sharing networks served by human-driven vehicles (HVs) and autonomous vehicles (AVs). We propose a model for ride-sharing in this mixed autonomy setting for a multi-location network in which a ride-sharing platform sets…
We introduce a new virtual environment for simulating a card game known as "Big 2". This is a four-player game of imperfect information with a relatively complicated action space (being allowed to play 1,2,3,4 or 5 card combinations from an…
We propose a generalized market equilibrium model using assignment game criteria for evaluating transportation systems that consist of both operators' and users' decisions. The model finds stable pricing, in terms of generalized costs, and…
The Traveling Tournament Problem (TTP-$k$) is a well-known benchmark problem in tournament timetabling, which asks us to design a double round-robin schedule such that the total traveling distance of all $n$ teams is minimized under the…
In multi-agent settings, game theory is a natural framework for describing the strategic interactions of agents whose objectives depend upon one another's behavior. Trajectory games capture these complex effects by design. In competitive…
We consider perfect-information reachability stochastic games for 2 players on infinite graphs. We identify a subclass of such games, and prove two interesting properties of it: first, Player Max always has optimal strategies in games from…
Speedrunning in general means to play a video game fast, i.e. using all means at one's disposal to achieve a given goal in the least amount of time possible. To do so, a speedrun must be planned in advance, or routed, as referred to by the…
Individualized treatment rules (ITRs) have gained significant attention due to their wide-ranging applications in fields such as precision medicine, ridesharing, and advertising recommendations. However, when ITRs are influenced by…
We study a competitive optimization version of $\alpha'(G)$, the maximum size of a matching in a graph $G$. Players alternate adding edges of $G$ to a matching until it becomes a maximal matching. One player (Max) wants that matching to be…
This paper revisits a classical problem of slotted multiple access with success, idle, and collision events on each slot. First, results of a 2-user multiple access game are reported. The game was conducted at the University of Southern…
We show that there is an $m=2n+o(n)$, such that, in the Maker-Breaker game played on $\Z^d$ where Maker needs to put at least $m$ of his marks consecutively in one of $n$ given winning directions, Breaker can force a draw using a pairing…
In multi-player card games such as Skat or Bridge, the early stages of the game, such as bidding, game selection, and initial card selection, are often more critical to the success of the play than refined middle- and end-game play. At the…
This study investigates an adaptive pricing scheme aimed at achieving an efficient state in a traffic congestion game characterized by a diverse population of road users. While the planner possesses knowledge of players' preferences, their…
We consider the traffic assignment problem in nonatomic routing games where the players' cost functions may be subject to random fluctuations (e.g., weather disturbances, perturbations in the underlying network, etc.). We tackle this…
Commercial entries, such as hotels, are ranked according to score by a search engine or recommendation system, and the score of each can be improved upon by making a targeted investment, e.g., advertising. We study the problem of how a…
In the popular computer game of Tetris, the player is given a sequence of tetromino pieces and must pack them into a rectangular gameboard initially occupied by a given configuration of filled squares; any completely filled row of the…
In this paper we examine problems motivated by on-line financial problems and stochastic games. In particular, we consider a sequence of entirely arbitrary distinct values arriving in random order, and must devise strategies for selecting…
The Urban Rail Transit (URT) has been one of the major trip modes in cities worldwide. As the passengers arrive at variable rates in different time slots, e.g., rush and non-rush hours, the departure frequency at a site directly relates to…
We demonstrate an iterative scheme to approximate the optimal transportation problem with a discrete target measure under certain standard conditions on the cost function. Additionally, we give a finite upper bound on the number of…