相关论文: Benchmark Problems for Totally Unimodular Set Syst…
Auctions play an important role in electronic commerce, and have been used to solve problems in distributed computing. Automated approaches to designing effective auction mechanisms are helpful in reducing the burden of traditional game…
The paper studies the problem of auction design in a setting where the auctioneer accesses the knowledge of the valuation distribution only through statistical samples. A new framework is established that combines the statistical decision…
An auction house cannot generally provide the optimal auction technology to every client. Instead it provides one or several auction technologies, and clients select the most appropriate one. For example, eBay provides ascending auctions…
The paper presents a collection of analytical benchmark problems specifically selected to provide a set of stress tests for the assessment of multifidelity optimization methods. In addition, the paper discusses a comprehensive ensemble of…
To contrast different generators for flow equations for Hamiltonians and to discuss the dependence of physical quantities on unitarily equivalent, but effectively different initial Hamiltonians, a numerically solvable model is considered…
Increasing number of the cloud-based Internet applications demands for efficient resource and cost management. This paper proposes a real-time group auction system for the cloud instance market. The system is designed based on a…
We design an expected polynomial-time, truthful-in-expectation, (1-1/e)-approximation mechanism for welfare maximization in a fundamental class of combinatorial auctions. Our results apply to bidders with valuations that are m matroid rank…
We study problems arising in real-time auction markets, common in e-commerce and computational advertising, where bidders face the problem of calculating optimal bids. We focus upon a contract management problem where a demand aggregator is…
In this article we consider combinatorial markets with valuations only for singletons and pairs of buy/sell-orders for swapping two items in equal quantity. We provide an algorithm that permits polynomial time market-clearing and -pricing.…
Digital advertising constitutes one of the main revenue sources for online platforms. In recent years, some advertisers tend to adopt auto-bidding tools to facilitate advertising performance optimization, making the classical \emph{utility…
In mechanism design, it is challenging to design the optimal auction with correlated values in general settings. Although value distribution can be further exploited to improve revenue, the complex correlation structure makes it hard to…
Algorithmic Mechanism Design attempts to marry computation and incentives, mainly by leveraging monetary transfers between designer and selfish agents involved. This is principally because in absence of money, very little can be done to…
Standard procurement models assume that the buyer knows the quality of the good at the time of procurement; however, in many settings, the quality is learned only long after the transaction. We study procurement problems in which the…
Auction has been used to allocate resources or tasks to processes, machines or other autonomous entities in distributed systems. When different bidders have different demands and valuations on different types of resources or tasks, the…
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been a lot of attention on the auction process and its game-theoretic aspects, our focus is on the advertisers. In particular,…
Many interesting problems in the Internet industry can be framed as a two-sided marketplace problem. Examples include search applications and recommender systems showing people, jobs, movies, products, restaurants, etc. Incorporating…
Online auction has been very widespread in the recent years. Platform administrators are working hard to refine their auction mechanisms that will generate high profits while maintaining a fair resource allocation. With the advancement of…
We study the classical weighted perfect matchings problem for bipartite graphs or sometimes referred to as the assignment problem, i.e., given a weighted bipartite graph $G = (U\cup V,E)$ with weights $w : E \rightarrow \mathcal{R}$ we are…
We perform a numerical approximation of coherent sets in finite-dimensional smooth dynamical systems by computing singular vectors of the transfer operator for a stochastically perturbed flow. This operator is obtained by solution of a…
The three-way table problem is to decide if there exists an l x m x n table satisfying given line sums, and find a table if there is one. It is NP-complete already for l=3 and every bounded integer program can be isomorphically represented…