Auction mechanisms for virtualization in 5G cellular networks: Basics, trends, and open challenges
Wireless network virtualization (WNV) is considered as a reliable and effective solution to
enhance the capacity and resource utilization in emerging 5G cellular wireless networks …
enhance the capacity and resource utilization in emerging 5G cellular wireless networks …
Online matching: A brief survey
Matching, capturing allocation of items to unit-demand buyers, or tasks to workers, or pairs of
collaborators, is a central problem in economics. Indeed, the growing prevalence of …
collaborators, is a central problem in economics. Indeed, the growing prevalence of …
Matroid prophet inequalities
Consider a gambler who observes a sequence of independent, non-negative random
numbers and is allowed to stop the sequence at any time, claiming a reward equal to the …
numbers and is allowed to stop the sequence at any time, claiming a reward equal to the …
Prophet inequalities made easy: Stochastic optimization by pricing nonstochastic inputs
We present a general framework for stochastic online maximization problems with
combinatorial feasibility constraints. The framework establishes prophet inequalities by …
combinatorial feasibility constraints. The framework establishes prophet inequalities by …
[KİTAP][B] Algorithms and theory of computation handbook, volume 2: special topics and techniques
MJ Atallah, M Blanton - 2009 - books.google.com
This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …
topics, techniques, and applications. Along with updating and revising many of the existing …
Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers
S Alaei - SIAM Journal on Computing, 2014 - SIAM
We present a general framework for approximately reducing the mechanism design problem
for multiple agents to single agent subproblems in the context of Bayesian combinatorial …
for multiple agents to single agent subproblems in the context of Bayesian combinatorial …
Prophet secretary for combinatorial auctions and matroids
The secretary and the prophet inequality problems are central to the field of Stop**
Theory. Recently, there has been a lot of work in generalizing these models to multiple items …
Theory. Recently, there has been a lot of work in generalizing these models to multiple items …
An economic view of prophet inequalities
B Lucier - ACM SIGecom Exchanges, 2017 - dl.acm.org
Over the past decade, an exciting connection has developed between the theory of posted-
price mechanisms and the prophet inequality, a result from the theory of optimal stop** …
price mechanisms and the prophet inequality, a result from the theory of optimal stop** …
Simple versus optimal contracts
We consider the classic principal-agent model of contract theory, in which a principal
designs an outcome-dependent compensation scheme to incentivize an agent to take a …
designs an outcome-dependent compensation scheme to incentivize an agent to take a …
Online stochastic max-weight matching: Prophet inequality for vertex and edge arrival models
We provide prophet inequality algorithms for online weighted matching in general (non-
bipartite) graphs, under two well-studied arrival models, namely edge arrival and vertex …
bipartite) graphs, under two well-studied arrival models, namely edge arrival and vertex …