English
Related papers

Related papers: Optimal mechanisms with budget for user generated …

200 papers

We consider the problem of designing a revenue-optimal mechanism in the two-item, single-buyer, unit-demand setting when the buyer's valuations, $(z_1, z_2)$, are uniformly distributed in an arbitrary rectangle $[c,c+b_1]\times[c,c+b_2]$ in…

Computer Science and Game Theory · Computer Science 2019-03-06 D. Thirumulanathan , Rajesh Sundaresan , Y Narahari

Artificial Intelligence Generated Content (AIGC) services can efficiently satisfy user-specified content creation demands, but the high computational requirements pose various challenges to supporting mobile users at scale. In this paper,…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-09-17 Shuangwei Gao , Peng Yang , Yuxin Kong , Feng Lyu , Ning Zhang

Optimization of expensive computer models with the help of Gaussian process emulators in now commonplace. However, when several (competing) objectives are considered, choosing an appropriate sampling strategy remains an open question. We…

Optimization and Control · Mathematics 2013-10-03 Victor Picheny

Selling reserved instances (or virtual machines) is a basic service in cloud computing. In this paper, we consider a more flexible pricing model for instance reservation, in which a customer can propose the time length and number of…

Computer Science and Game Theory · Computer Science 2016-11-23 Jia Zhang , Weidong Ma , Tao Qin , Xiaoming Sun , Tie-Yan Liu

Assortment optimization concerns the problem of selling items with fixed prices to a buyer who will purchase at most one. Typically, retailers select a subset of items, corresponding to an "assortment" of brands to carry, and make each…

Computer Science and Game Theory · Computer Science 2022-05-23 Will Ma

We consider the problem of budget allocation for competitive influence maximization over social networks. In this problem, multiple competing parties (players) want to distribute their limited advertising resources over a set of social…

Computer Science and Game Theory · Computer Science 2021-08-31 S. Rasoul Etesami

In this paper, we propose three generic models of capacitated coverage and, more generally, submodular maximization to study task-worker assignment problems that arise in a wide range of gig economy platforms. Our models incorporate the…

Data Structures and Algorithms · Computer Science 2023-09-19 Pan Xu

This paper proposes the framework of an efficient gig-work management system. A gig-work management system recommends one-off tasks with information about task hours and wages to gig-workers. To enable effective management, this paper…

Systems and Control · Electrical Eng. & Systems 2025-12-15 Kazuyoshi Fukuda , Masaki Inoue , Riko Asanaka

We consider a participatory budgeting problem in which each voter submits a proposal for how to divide a single divisible resource (such as money or time) among several possible alternatives (such as public projects or activities) and these…

Computer Science and Game Theory · Computer Science 2022-01-24 Rupert Freeman , David M. Pennock , Dominik Peters , Jennifer Wortman Vaughan

In this report we construct two mechanisms that fully implement social welfare maximising allocation in Nash equilibria for the case of a single infinitely divisible good subject to multiple inequality constraints. The first mechanism…

Computer Science and Game Theory · Computer Science 2014-02-06 Abhinav Sinha , Achilleas Anastasopoulos

Modular design maximizes utility by using standardized components in large-scale systems. From a manufacturing perspective, it supports green technology by reducing material waste and improving reusability. Industrially, it offers economic…

Emerging Technologies · Computer Science 2025-03-18 Sumin Lee , Namwoo Kang

We study the problem of computing maximin share guarantees, a recently introduced fairness notion. Given a set of $n$ agents and a set of goods, the maximin share of a single agent is the best that she can guarantee to herself, if she would…

Computer Science and Game Theory · Computer Science 2018-06-12 Georgios Amanatidis , Evangelos Markakis , Afshin Nikzad , Amin Saberi

This paper focuses on managing the cost of deliberation before action. In many problems, the overall quality of the solution reflects costs incurred and resources consumed in deliberation as well as the cost and benefit of execution, when…

Artificial Intelligence · Computer Science 2013-04-05 David Einav , Michael R. Fehling

Let $G$ be a finite group generated by $k$ elements. The well-known product replacement algorithm provides an effective method for sampling generating sets of $G$. We study a refinement of this algorithm that is designed to output…

Group Theory · Mathematics 2025-12-23 Michał Marcinkowski , Piotr Mizerka

In budget-feasible mechanism design, a buyer wishes to procure a set of items of maximum value from self-interested players. We have a valuation function $v:2^U \to \mathbb{R}_+$, where $U$ is the set of all items, where $v(S)$ specifies…

Computer Science and Game Theory · Computer Science 2026-03-25 Rian Neogi , Kanstantsin Pashkovich , Chaitanya Swamy

In this paper, we introduce a Bayesian revenue-maximizing mechanism design model where the items have fixed, exogenously-given prices. Buyers are unit-demand and have an ordinal ranking over purchasing either one of these items at its given…

Computer Science and Game Theory · Computer Science 2020-10-16 Will Ma

Strategic product placement can have a strong influence on customer purchase behavior in physical stores as well as online platforms. Motivated by this, we consider the problem of optimizing the placement of substitutable products in…

Data Structures and Algorithms · Computer Science 2025-10-06 Omar El Housni , Rajan Udwani

Social utility maximization refers to the process of allocating resources in such a way that the sum of agents' utilities is maximized under the system constraints. Such allocation arises in several problems in the general area of…

Computer Science and Game Theory · Computer Science 2015-03-10 Abhinav Sinha , Achilleas Anastasopoulos

We study an online revenue maximization problem where the consumers arrive i.i.d from some unknown distribution and purchase a bundle of products from the sellers. The classical approach generally assumes complete knowledge of the consumer…

Computer Science and Game Theory · Computer Science 2022-10-04 Owen Shen

Submodular function maximization has been studied extensively in recent years under various constraints and models. The problem plays a major role in various disciplines. We study a natural online variant of this problem in which elements…

Data Structures and Algorithms · Computer Science 2015-01-26 Niv Buchbinder , Moran Feldman , Roy Schwartz
‹ Prev 1 3 4 5 6 7 10 Next ›