English
Related papers

Related papers: Rank-preserving Multidimensional Mechanisms: an eq…

200 papers

Auction is applied for trade with various mechanisms. A simple but practical question is which mechanism, typically first-price or second-price auctions, is preferred from the perspective of bidders or sellers. A celebrated answer is…

Computer Science and Game Theory · Computer Science 2026-02-20 Yuma Fujimoto , Kaito Ariu , Kenshi Abe

I consider a mechanism design problem of selling multiple goods to multiple bidders when the designer has minimal amount of information. I assume that the designer only knows the upper bounds of bidders' values for each good and has no…

Theoretical Economics · Economics 2022-05-02 Wanchang Zhang

We consider homogenization problems in the framework of deterministic optimal control when the dynamics and running costs are completely different in two (or more) complementary domains of the space $\R^N$. For such optimal control…

Analysis of PDEs · Mathematics 2014-05-06 Guy Barles , Ariela Briani , Emmanuel Chasseigne , Nicoletta Tchou

We design a fixed-price auction mechanism for a seller to sell multiple items in a tree-structured market. The buyers have independently drawn valuation from a uniform distribution, and the seller would like to incentivize buyers to invite…

Computer Science and Game Theory · Computer Science 2024-08-01 Feiyang Yu

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

We consider the sample complexity of revenue maximization for multiple bidders in unrestricted multi-dimensional settings. Specifically, we study the standard model of $n$ additive bidders whose values for $m$ heterogeneous items are drawn…

Computer Science and Game Theory · Computer Science 2021-04-13 Yannai A. Gonczarowski , S. Matthew Weinberg

We study the optimal pricing strategies of a monopolist selling a divisible good (service) to consumers that are embedded in a social network. A key feature of our model is that consumers experience a (positive) local network effect. In…

Computer Science and Game Theory · Computer Science 2011-01-31 Ozan Candogan , Kostas Bimpikis , Asuman Ozdaglar

This paper studies an online selection problem, where a seller seeks to sequentially sell multiple copies of an item to arriving buyers. We consider an adversarial setting, making no modeling assumptions about buyers' valuations for the…

Computer Science and Game Theory · Computer Science 2024-10-11 Bo Sun , Hossein Nekouyan Jazi , Xiaoqi Tan , Raouf Boutaba

I study multidimensional sequential screening. A monopolist contracts with a buyer who privately observes information about the distribution of their eventual valuations for multiple goods. After initial private information is reported and…

Theoretical Economics · Economics 2026-05-05 Eric Gao

Managing a book of options on several underlying involves controlling positions of several thousands of financial assets. It is one of the most challenging financial problems involving both pricing and microstructural modeling. An options…

Trading and Market Microstructure · Quantitative Finance 2020-09-03 Bastien Baldacci , Joffrey Derchu , Iuliia Manziuk

Consider a monopolist selling $n$ items to an additive buyer whose item values are drawn from independent distributions $F_1,F_2,\ldots,F_n$ possibly having unbounded support. Unlike in the single-item case, it is well known that the…

Computer Science and Game Theory · Computer Science 2021-04-13 Moshe Babaioff , Yannai A. Gonczarowski , Noam Nisan

In this paper, we study the classic problem of fairly allocating indivisible items with the extra feature that the items lie on a line. Our goal is to find a fair allocation that is contiguous, meaning that the bundle of each agent forms a…

Computer Science and Game Theory · Computer Science 2019-04-30 Warut Suksompong

This paper compares two leading approaches for robust optimization in the models of online algorithms and mechanism design. Competitive analysis compares the performance of an online algorithm to an offline benchmark in worst-case over…

Computer Science and Game Theory · Computer Science 2020-09-09 Jason Hartline , Aleck Johnsen , Yingkai Li

We provide a computationally efficient black-box reduction from mechanism design to algorithm design in very general settings. Specifically, we give an approximation-preserving reduction from truthfully maximizing \emph{any} objective under…

Computer Science and Game Theory · Computer Science 2013-05-20 Yang Cai , Constantinos Daskalakis , S. Matthew Weinberg

Self-organization of complex morphological patterns from local interactions is a fascinating phenomenon in many natural and artificial systems. In the artificial world, typical examples of such morphogenetic systems are cellular automata.…

Machine Learning · Computer Science 2021-09-06 Mayalen Etcheverry , Clement Moulin-Frier , Pierre-Yves Oudeyer

Given an initial matching and a policy objective on the distribution of agent types to institutions, we study the existence of a mechanism that weakly improves the distributional objective and satisfies constrained efficiency, individual…

Theoretical Economics · Economics 2023-03-13 Isa E. Hafalir , Fuhito Kojima , M. Bumin Yenmez

We show that in the single-parameter mechanism design environment, the only non-wasteful, symmetric, incentive compatible and Sybil-proof direct mechanism is a second price auction with symmetric tie-breaking. Thus, if there is private…

Computer Science and Game Theory · Computer Science 2026-02-10 Minghao Pan , Bruno Mazorra , Christoph Schlegel , Akaki Mamageishvili

We develop a general duality-theory framework for revenue maximization in additive Bayesian auctions. The framework extends linear programming duality and complementarity to constraints with partial derivatives. The dual system reveals the…

Computer Science and Game Theory · Computer Science 2018-01-16 Yiannis Giannakopoulos , Elias Koutsoupias

We consider a revenue-maximizing seller with $m$ heterogeneous items and a single buyer whose valuation $v$ for the items may exhibit both substitutes (i.e., for some $S, T$, $v(S \cup T) < v(S) + v(T)$) and complements (i.e., for some $S,…

Computer Science and Game Theory · Computer Science 2017-04-11 Alon Eden , Michal Feldman , Ophir Friedler , Inbal Talgam-Cohen , S. Matthew Weinberg

For linear multivariate purely second order highla degenerated parabolic equations with univariate convex data, monotonicity of the coefficent matrices implies monotonicity of the related value functions under usual regularity and growth…

Probability · Mathematics 2017-06-15 Jörg Kampen , Jan Vecer
‹ Prev 1 8 9 10 Next ›