5 papers
Knapsack Secretary is not -Competitive
Marius Garbea, Rishi Patel, Emmanouil Pountourakis
We prove that no algorithm for the knapsack secretary problem can be -competitive. The knapsack secretary problem was first introduced by Babaioff, Immorlica, Kempe, and Klein…
Repeated Sales with Heterogeneous Buyer Sophistication
Rishi Patel, Emmanouil Pountourakis, Samuel Taggart
This paper considers behavior-based price discrimination in the repeated sale of a non-durable good to a single long-lived buyer, by a seller without commitment power. We assume th…
Polynomial-Time Approximation Schemes via Utility Alignment: Unit-Demand Pricing and More
Robin Bowers, Marius Garbea, Emmanouil Pountourakis +1
This paper derives polynomial-time approximation schemes for several NP-hard stochastic optimization problems from the algorithmic mechanism design and operations research literatu…
The Price of Pessimism for Automated Defense
Erick Galinkin, Emmanouil Pountourakis, Spiros Mancoridis
The well-worn George Box aphorism ``all models are wrong, but some are useful'' is particularly salient in the cybersecurity domain, where the assumptions built into a model can ha…
Simple Delegated Choice
Ali Khodabakhsh, Emmanouil Pountourakis, Samuel Taggart
This paper studies delegation in a model of discrete choice. In the delegation problem, an uninformed principal must consult an informed agent to make a decision. Both the agent an…