English
Related papers

Related papers: Learning to Maximize Gains From Trade in Small Mar…

200 papers

Market power exercise in the electricity markets distorts market prices and diminishes social welfare. Many markets have implemented market power mitigation processes to eliminate the impact of such behavior. The design of mitigation…

Optimization and Control · Mathematics 2022-11-08 Yiqian Wu , Jip Kim , James Anderson

The seminal impossibility result of Myerson and Satterthwaite (1983) states that for bilateral trade, there is no mechanism that is individually rational (IR), incentive compatible (IC), weakly budget balanced, and efficient. This has led…

Computer Science and Game Theory · Computer Science 2018-02-23 Moshe Babaioff , Yang Cai , Yannai A. Gonczarowski , Mingfei Zhao

This dissertation examines three distinct big data analytics problems related to the social aspects of consumers' choices. The main goal of this line of research is to help two sided platform firms to target their marketing policies given…

Other Statistics · Statistics 2017-02-24 Meisam Hejazi Nia

In this paper, the optimal pricing strategy in Avellande-Stoikov's for a monopolistic dealer is extended to a general situation where multiple dealers are present in a competitive market. The dealers' trading intensities, their optimal bid…

Trading and Market Microstructure · Quantitative Finance 2015-12-31 Wai-Ki Ching , Jia-Wen Gu , Qing-Qing Yang , Tak-Kuen Siu

Designing an incentive compatible auction that maximizes expected revenue is an intricate task. The single-item case was resolved in a seminal piece of work by Myerson in 1981, but more than 40 years later a full analytical understanding of…

Computer Science and Game Theory · Computer Science 2022-10-17 Paul Dütting , Zhe Feng , Harikrishna Narasimhan , David C. Parkes , Sai Srivatsa Ravindranath

We consider some classical optimization problems in path planning and network transport, and we introduce new auction-based algorithms for their optimal and suboptimal solution. The algorithms are based on mathematical ideas that are…

Optimization and Control · Mathematics 2022-07-21 Dimitri Bertsekas

In this paper we formulate a contract design problem where a primary license holder wishes to profit from its excess spectrum capacity by selling it to potential secondary users/buyers. It needs to determine how to optimally price the…

Computational Engineering, Finance, and Science · Computer Science 2012-07-30 Shang-Pin Sheng , Mingyan Liu

This paper deals with two-sided matching market with two disjoint sets, i.e. the set of buyers and the set of sellers. Each seller can trade with at most with one buyer and vice versa. Money is transferred from sellers to buyers for an…

Computer Science and Game Theory · Computer Science 2023-06-22 Yasir Ali , Asma Javaid

In this work, we study a generalized Fisher market model that incorporates social influence. In this extended model, a buyer's utility depends not only on their own resource allocation but also on the allocations received by their…

Computer Science and Game Theory · Computer Science 2025-01-14 Mandar Datar

This paper develops a general approach, rooted in statistical learning theory, to learning an approximately revenue-maximizing auction from data. We introduce $t$-level auctions to interpolate between simple auctions, such as welfare…

Computer Science and Game Theory · Computer Science 2015-06-12 Jamie Morgenstern , Tim Roughgarden

We study the classic bilateral trade setting. Myerson and Satterthwaite show that there is no Bayesian incentive compatible and budget-balanced mechanism that obtains the gains from trade of the first-best mechanism. Consider the…

Computer Science and Game Theory · Computer Science 2021-11-16 Moshe Babaioff , Shahar Dobzinski , Ron Kupfer

We consider the problem of designing revenue-optimal auctions for selling two items and bidders' valuations are independent among bidders but negatively correlated among items. In this paper, we obtain the closed-form optimal auction for…

Computer Science and Game Theory · Computer Science 2016-06-03 Pingzhong Tang , Zihe Wang

Bilateral trade is one of the most natural and important forms of economic interaction: A seller has a single, indivisible item for sale, and a buyer is potentially interested. The two parties typically have different, privately known…

Computer Science and Game Theory · Computer Science 2023-12-20 Yixuan Even Xu , Hanrui Zhang , Vincent Conitzer

We study the problem of allocating indivisible goods among agents with additive valuation functions to achieve both fairness and efficiency under the constraint that each agent receives exactly the same number of goods (the \emph{balanced…

Computer Science and Game Theory · Computer Science 2026-03-09 Yasushi Kawase , Ryoga Mahara

In light of the growing market of Ad Exchanges for the real-time sale of advertising slots, publishers face new challenges in choosing between the allocation of contract-based reservation ads and spot market ads. In this setting, the…

Optimization and Control · Mathematics 2012-09-25 Santiago Balseiro , Jon Feldman , Vahab Mirrokni , S. Muthukrishnan

We study a simple problem of allocating common-value goods. The designer seeks to allocate the goods to as many unit-demand agents as possible without monetary transfers, while agents, who possess partial private information about the…

Theoretical Economics · Economics 2026-04-22 Hiroto Sato , Ryo Shirakawa

We present a general framework for proving polynomial sample complexity bounds for the problem of learning from samples the best auction in a class of "simple" auctions. Our framework captures all of the most prominent examples of "simple"…

Machine Learning · Computer Science 2016-04-13 Jamie Morgenstern , Tim Roughgarden

A monopolistic seller aims to sell an indivisible item to multiple potential buyers. Each buyer's valuation depends on their private type and the item's quality. The seller can observe the quality but it is unknown to buyers. This quality…

Computer Science and Game Theory · Computer Science 2024-11-13 Zhikang Fan , Weiran Shen

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

This paper proposes a doubled-sided auction mechanism with price discrimination for social welfare (SW) maximization in the electricity and heating market. In this mechanism, energy service providers (ESPs) submit offers and load…

Computer Science and Game Theory · Computer Science 2022-05-31 Lu Wang , Wei Gu , Shuai Lu , Haifeng Qiu , Zhi Wu
‹ Prev 1 8 9 10 Next ›