We provide a polynomial time reduction from Bayesian incentive compatible mechanism
design to Bayesian algorithm design for welfare maximization problems. Unlike prior results …

The permutation flow shop scheduling (PFSS), aiming at finding the optimal permutation of
jobs, is widely used in manufacturing systems. When solving large-scale PFSS problems …

The financial lease is an important financing tool by which the lessee can acquire ownership
of equipment upon the expiration of the lease after making a series of rent payments for the …

In this paper, we design posted price mechanisms for assigning electric vehicles (EVs) to
electric vehicle supply equipment (EVSEs) to maximize the smart charging potential of a …

We formulate a novel class of online matching problems with learning. In these problems,
randomly arriving customers must be matched to perishable resources so as to maximize a …

This paper studies the online stochastic resource allocation problem (RAP) with chance
constraints. The online RAP is a 0-1 integer linear programming problem where the …

We study the online constrained ranking problem motivated by an application to web-traffic
sha**: an online stream of sessions arrive in which, within each session, we are asked to …

This paper studies the online stochastic resource allocation problem (RAP) with chance
constraints and conditional expectation constraints. The online RAP is an integer linear …

The first part of this work considers a misspecified optimization problem that requires
minimizing a function f (x; &thetas;*) over a closed and convex set X where &thetas;* is an …

This paper presents an online advertising assignment problem that generalizes the online
version of the bipartite matching problem. Specifically, it focuses on the Display Ads …