We consider a dynamic pricing problem where a firm sells one item to a single buyer in order to maximize expected revenues. The firm commits to a price function over an infinite horizon. The buyer arrives at some random time with a private value for the item. He is more impatient than the seller...

Dynamic resource allocation problems arise under a variety of settings and have been studied across disciplines such as Operations Research and Computer Science. The present paper introduces a unifying model for a very large class of dynamic optimization problems, that we call dynamic resource...

Consider a sender and a receiver as two distant nodes in a network. The sender wishes to transmit a secret to the receiver, but faces an adversary controlling an unknown set of nodes. We characterize the directed networks for which there exist \epilson-secret and \epsilon-strongly secure...