In retail, there are predictable yet dramatic time-dependent patterns in customer behavior, such as periodic changes in the number of visitors, or increases in visitors just before major holidays (e.g., Christmas). The current paradigm of multi-armed bandit analysis does not take these known patterns into account, which means that despite the firm theoretical foundation of these methods, they a...

In order to interact with the world, people must be able to predict how it will unfold in the future, and these predictions must be updated regularly in light of new information. Here we study how the mind updates these predictions over time. Participants were asked to make ongoing predictions about the destination of a simulated ball moving on a 2D bumper table. We modeled these decisions by a...

Flows over time (also called dynamic flows) generalize standard network flows by introducing an element of time. They naturally model problems where travel and transmission are not instantaneous. Traditionally, flows over time are solved in time-expanded networks that contain one copy of the original network for each discrete time step. While this method makes available the whole algorithmic to...

In this note we introduce the problem of assortment optimization over time. We have a sequence of time steps and can introduce one new product per time step. Once introduced a product can not be removed. The goal is to determine which products to introduce so as to maximize revenue over all time steps under some choice model. Given a 1/α-approximation algorithm for the capacitated assortment op...

Since 1996, some models of recursive functions over the real numbers have been analyzed by several researchers. It could be expected that they exhibit a computational power much greater than that of Turing machines (as other well known models of computation over the real numbers already considered in the past fifteen years, like neural net models with real weights). The fact is that they have n...

We have developed a text summarization system that can generate summaries over time from web crawls on disasters. We show that our method of identifying exemplar sentences for a summary using affinity propagation clustering produces better summaries than clustering based on K-medoids as measured using Rouge on a small set of examples. A key component of our approach is the prediction of salient...

Political authorities have historically had a mysterious tendency towards theocracy, exemplified by their religious titles, close affiliations with religious figures, or even divine powers. To examine theocracy over time, we constructed two unique datasets, one that includes information on the political and religious characteristics of over five hundred polities observed in history and another ...

Continuity in attachment classification from infancy to late adolescence was examined and related to autobiographical memories of childhood, divorce, and maladjustment. Eighty-four White middle-class children (48 girls) were seen in a modified Strange Situation at 12 months and given the Adult Attachment Interview at 18 years. In addition, data were collected on 13-year-olds' childhood recollec...

Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players allocate resources simultaneously and instantly. This is particularly unrealistic for many network routing scenarios, which are one of the prominent application scenarios of congestion games. In many networks, load trav...

The sensory rcsponse lo ligltl persists in lime. This fact obliges us to ui'n.ierst:ind how the temporally distrihuted effects of visual slimukition collectively determine thrcshokl, A cl;tssieiiI solution to this problem has been to supposc lh;il the eye integrates the light sis,n;il ovrr somc inlcrviil of timc, the criliciil durcition. The light is visible whenever the intcgritl exceeds some ...