What price should be offered to a worker for a task in an online labor market? How can one
enable workers to express the amount they desire to receive for the task completion …

Every day millions of crowdsourcing tasks are performed in exchange for payments. Despite
the important role pricing plays in crowdsourcing campaigns and the complexity of the …

A natural optimization model that formulates many online resource allocation problems is
the online linear programming (LP) problem in which the constraint matrix is revealed …

Mobile crowd sensing (MCS) is a new paradigm that takes advantage of pervasive mobile
devices to efficiently collect data, enabling numerous novel applications. To achieve good …

Fog computing is emerging as a promising paradigm to perform distributed, low-latency
computation by jointly exploiting the radio and computing resources of end-user devices and …

Constrained submodular maximization problems have long been studied, most recently in
the context of auctions and computational advertising, with near-optimal results known …

Optimal stopping theory is a powerful tool for analyzing scenarios such as online auctions in
which we generally require optimizing an objective function over the space of stopping rules …

Online auction is the essence of many modern markets, particularly networked markets, in
which information about goods, agents, and outcomes is revealed over a period of time, and …

We consider a canonical quantity-based network revenue management problem where a
firm accepts or rejects incoming customer requests irrevocably in order to maximize …

We present generalized secretary problems as a framework for online auctions. Elements,
such as potential employees or customers, arrive one by one online. After observing the …