English
Related papers

Related papers: Multi-dimensional Virtual Values and Second-degree…

200 papers

Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute actions in stochastic environments, modeled as Markov decision…

Multiagent Systems · Computer Science 2011-10-13 D. A. Dolgov , E. H. Durfee

As e-commerce expands, delivering real-time personalized recommendations from vast catalogs poses a critical challenge for retail platforms. Maximizing revenue requires careful consideration of both individual customer characteristics and…

Information Retrieval · Computer Science 2026-02-16 Seong Jin Lee , Will Wei Sun , Yufeng Liu

This paper studies convex duality in optimal investment and contingent claim valuation in markets where traded assets may be subject to nonlinear trading costs and portfolio constraints. Under fairly general conditions, the dual expressions…

Mathematical Finance · Quantitative Finance 2016-03-10 Teemu Pennanen , Ari-Pekka Perkkiö

Online double auctions (DAs) model a dynamic two-sided matching problem with private information and self-interest, and are relevant for dynamic resource and task allocation problems. We present a general method to design truthful DAs, such…

Computer Science and Game Theory · Computer Science 2012-07-09 Jonathan Bredin , David C. Parkes

Contemporary recommender systems act as intermediaries on multi-sided platforms serving high utility recommendations from sellers to buyers. Such systems attempt to balance the objectives of multiple stakeholders including sellers, buyers,…

Artificial Intelligence · Computer Science 2020-09-09 Harshal A. Chaudhari , Sangdi Lin , Ondrej Linda

Two-sided marketplaces embody heterogeneity in incentives: producers seek exposure while consumers seek relevance, and balancing these competing objectives through constrained optimization is now a standard practice. Yet real platforms face…

Computer Science and Game Theory · Computer Science 2026-02-13 Dominykas Seputis , Alexander Timans , Rajeev Verma

Applications such as employees sharing office spaces over a workweek can be modeled as problems where agents are matched to resources over multiple rounds. Agents' requirements limit the set of compatible resources and the rounds in which…

Artificial Intelligence · Computer Science 2022-12-01 Yohai Trabelsi , Abhijin Adiga , Sarit Kraus , S. S. Ravi , Daniel J. Rosenkrantz

Consider the following toy problem. There are $m$ rectangles and $n$ points on the plane. Each rectangle $R$ is a consumer with budget $B_R$, who is interested in purchasing the cheapest item (point) inside R, given that she has enough…

Computer Science and Game Theory · Computer Science 2012-07-25 Parinya Chalermsook , Khaled Elbassioni , Danupon Nanongkai , He Sun

We study the pricing problem faced by a firm that sells a large number of products, described via a wide range of features, to customers that arrive over time. Customers independently make purchasing decisions according to a general choice…

Machine Learning · Statistics 2018-01-03 Adel Javanmard , Hamid Nazerzadeh

With spectrum auctions as our prime motivation, in this paper we analyze combinatorial auctions where agents' valuations exhibit complementarities. Assuming that the agents only value bundles of size at most $k$ and also assuming that we…

Computer Science and Game Theory · Computer Science 2016-06-07 Dengwang Tang , Vijay Subramanian

In markets such as digital advertising auctions, bidders want to maximize value rather than payoff. This is different to the utility functions typically assumed in auction theory and leads to different strategies and outcomes. We refer to…

Computer Science and Game Theory · Computer Science 2016-07-14 Salman Fadaei , Martin Bichler

Bike-sharing systems are emerging in various cities as a new ecofriendly transportation system. In these systems, spatiotemporally varying user demands lead to imbalanced inventory at bicycle stations, resulting in additional relocation…

Machine Learning · Computer Science 2025-09-01 Tatsuya Mitomi , Fumiyasu Makinoshima , Fumiya Makihara , Eigo Segawa

We study a dynamic market setting where an intermediary interacts with an unknown large sequence of agents that can be either sellers or buyers: their identities, as well as the sequence length $n$, are decided in an adversarial, online…

Computer Science and Game Theory · Computer Science 2017-03-29 Yiannis Giannakopoulos , Elias Koutsoupias , Philip Lazos

The Metaverse is regarded as the next-generation Internet paradigm that allows humans to play, work, and socialize in an alternative virtual world with immersive experience, for instance, via head-mounted display for Virtual Reality (VR)…

Computer Science and Game Theory · Computer Science 2021-11-09 Minrui Xu , Dusit Niyato , Jiawen Kang , Zehui Xiong , Chunyan Miao , Dong In Kim

We study the problem of auction design for advertising platforms that face strategic advertisers who are bidding across platforms. Each advertiser's goal is to maximize their total value or conversions while satisfying some constraint(s)…

Computer Science and Game Theory · Computer Science 2024-05-07 Gagan Aggarwal , Andres Perlroth , Ariel Schvartzman , Mingfei Zhao

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…

Artificial Intelligence · Computer Science 2020-06-24 Kinjal Basu , Cyrus DiCiccio , Heloise Logan , Noureddine El Karoui

We study truthful mechanisms for welfare maximization in online bipartite matching. In our (multi-parameter) setting, every buyer is associated with a (possibly private) desired set of items, and has a private value for being assigned an…

Computer Science and Game Theory · Computer Science 2024-02-20 Michal Feldman , Federico Fusco , Stefano Leonardi , Simon Mauras , Rebecca Reiffenhäuser

In mechanism design it is typical to impose incentive compatibility and then derive an optimal mechanism subject to this constraint. By replacing the incentive compatibility requirement with the goal of minimizing expected ex post regret,…

Computer Science and Game Theory · Computer Science 2012-08-07 Paul Duetting , Felix Fischer , Pitchayut Jirapinyo , John K. Lai , Benjamin Lubin , David C. Parkes

We study the revenue maximization problem of a seller with n heterogeneous items for sale to a single buyer whose valuation function for sets of items is unknown and drawn from some distribution D. We show that if D is a distribution over…

Computer Science and Game Theory · Computer Science 2018-07-05 Aviad Rubinstein , S. Matthew Weinberg

In many applications, ads are displayed together with the prices, so as to provide a direct comparison among similar products or services. The price-displaying feature not only influences the consumers' decisions, but also affects the…

Artificial Intelligence · Computer Science 2023-03-24 Bin Li , Yahui Lei
‹ Prev 1 8 9 10 Next ›