English
Related papers

Related papers: Optimal Strategy-proof Mechanisms on Single-crossi…

200 papers

When explaining black-box machine learning models, it's often important for explanations to have certain desirable properties. Most existing methods `encourage' desirable properties in their construction of explanations. In this work, we…

Machine Learning · Computer Science 2025-07-22 Hiwot Belay Tadesse , Alihan Hüyük , Yaniv Yacoby , Weiwei Pan , Finale Doshi-Velez

We analyze a model of selling a single object to a principal-agent pair who want to acquire the object for a firm. The principal and the agent have different assessments of the object's value to the firm. The agent is budget-constrained…

Theoretical Economics · Economics 2024-10-07 Debasis Mishra , Kolagani Paramahamsa

We examine information structure design, also called "persuasion" or "signaling", in the presence of a constraint on the amount of communication. We focus on the fundamental setting of bilateral trade, which in its simplest form involves a…

Computer Science and Game Theory · Computer Science 2020-03-09 Shaddin Dughmi , David Kempe , Ruixin Qiang

Motivated by applications to word-of-mouth advertising, we consider a game-theoretic scenario in which competing advertisers want to target initial adopters in a social network. Each advertiser wishes to maximize the resulting cascade of…

Computer Science and Game Theory · Computer Science 2014-03-26 Allan Borodin , Mark Braverman , Brendan Lucier , Joel Oren

This paper tackles challenges in pricing and revenue projections due to consumer uncertainty. We propose a novel data-based approach for firms facing unknown consumer type distributions. Unlike existing methods, we assume firms only observe…

Theoretical Economics · Economics 2024-05-28 Duarte Gonçalves , Bruno A. Furtado

In this paper we consider multidimensional mechanism design problem for selling discrete substitutable items to a group of buyers. Previous work on this problem mostly focus on stochastic description of valuations used by the seller.…

Computer Science and Game Theory · Computer Science 2017-01-05 Maciej Drwal

This paper studies optimal bundling of products with non-additive values. Under monotonic preferences and single-peaked profits, I show a monopolist finds pure bundling optimal if and only if the optimal sales volume for the grand bundle is…

General Economics · Economics 2022-04-22 Soheil Ghili

Classical optimal auction theory assumes that bids reach the seller directly. We study how this picture changes when a revenue-maximizing intermediary controls access to the seller's auction. Motivated by blockchain auctions, online…

Computer Science and Game Theory · Computer Science 2026-05-22 Jingyi Liu , Aviad Rubinstein , Ertem Nusret Tas , S. Matthew Weinberg , Qianfan Zhang

We investigate activities that have different periods of duration. We define the profit intensity as a measure of this economic category. The profit intensity in a repeated trading has a unique property of attaining its maximum at a fixed…

Trading and Market Microstructure · Quantitative Finance 2009-11-13 Edward W. Piotrowski , Jan Sladkowski

We study principal-agent problems in which a principal commits to an outcome-dependent payment scheme -- called contract -- in order to induce an agent to take a costly, unobservable action leading to favorable outcomes. We consider a…

Computer Science and Game Theory · Computer Science 2024-06-10 Francesco Bacchiocchi , Matteo Castiglioni , Alberto Marchesi , Nicola Gatti

Personalized pricing, which involves tailoring prices based on individual characteristics, is commonly used by firms to implement a consumer-specific pricing policy. In this process, buyers can also strategically manipulate their feature…

Machine Learning · Statistics 2024-06-27 Pangpang Liu , Zhuoran Yang , Zhaoran Wang , Will Wei Sun

We design novel mechanisms for welfare-maximization in two-sided markets. That is, there are buyers willing to purchase items and sellers holding items initially, both acting rationally and strategically in order to maximize utility. Our…

Computer Science and Game Theory · Computer Science 2021-06-01 Alexander Braun , Thomas Kesselheim

We study the mechanism design problem of selling $k$ items to unit-demand buyers with private valuations for the items. A buyer either participates directly in the auction or is represented by an intermediary, who represents a subset of…

Computer Science and Game Theory · Computer Science 2021-11-23 Gagan Aggarwal , Kshipra Bhawalkar , Guru Guruganesh , Andres Perlroth

This paper deals with optimal prediction in a regime-switching model driven by a continuous-time Markov chain. We extend existing results for geometric Brownian motion by deriving optimal stopping strategies that depend on the current…

Probability · Mathematics 2016-06-27 Yue Liu , Nicolas Privault

We study a class of procurement auctions with a budget constraint, where an auctioneer is interested in buying resources or services from a set of agents. Ideally, the auctioneer would like to select a subset of the resources so as to…

Computer Science and Game Theory · Computer Science 2017-10-10 Georgios Amanatidis , Georgios Birmpas , Evangelos Markakis

A fertile area of recent research has demonstrated concrete polynomial time lower bounds for solving natural hard problems on restricted computational models. Among these problems are Satisfiability, Vertex Cover, Hamilton Path, Mod6-SAT,…

Computational Complexity · Computer Science 2010-02-03 Ryan Williams

Catering to the incentives of people with limited rationality is a challenging research direction that requires novel paradigms to design mechanisms and approximation algorithms. Obviously strategyproof (OSP) mechanisms have recently…

Computer Science and Game Theory · Computer Science 2018-10-10 Diodato Ferraioli , Adrian Meier , Paolo Penna , Carmine Ventre

We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and the seller must make the allocation and payment decisions…

Computer Science and Game Theory · Computer Science 2009-05-22 Moshe Babaioff , Liad Blumrosen , Aaron L. Roth

We investigate the problem of designing randomized obviously strategy-proof (OSP) mechanisms in several canonical auction settings. Obvious strategy-proofness, introduced by Li [American Economic Review, 2017], strengthens the well-known…

Computer Science and Game Theory · Computer Science 2025-02-18 Shiri Ron , Daniel Schoepflin

A speculative agent with Prospect Theory preference chooses the optimal time to purchase and then to sell an indivisible risky asset to maximize the expected utility of the round-trip profit net of transaction costs. The optimization…

Mathematical Finance · Quantitative Finance 2022-10-26 Alex S. L. Tse , Harry Zheng
‹ Prev 1 8 9 10 Next ›