scholarly journals Approximately Maximizing the Broker's Profit in a Two-sided Market

2019 ◽  
Author(s):  
Jing Chen ◽  
Bo Li ◽  
Yingkai Li
Keyword(s):  
Production Cost ◽  
Dominant Strategy ◽  
Valuation Function ◽  
Optimal Production ◽  
Single Item ◽  
Incentive Compatible ◽  
Private Value ◽  
Cost Monotonicity ◽  
Strategy Incentive ◽  
Two Sided Markets

We study how to maximize the broker's (expected) profit in a two-sided market, where she buys items from a set of sellers and resells them to a set of buyers. Each seller has a single item to sell and holds a private value on her item, and each buyer has a valuation function over the bundles of the sellers' items. We consider the Bayesian setting where the agents' values/valuations are independently drawn from prior distributions, and aim at designing dominant-strategy incentive-compatible (DSIC) mechanisms that are approximately optimal. Production-cost markets, where each item has a publicly-known cost to be produced, provide a platform for us to study two-sided markets. Briefly, we show how to covert a mechanism for production-cost markets into a mechanism for the broker, whenever the former satisfies cost-monotonicity. This reduction holds even when buyers have general combinatorial valuation functions. When the buyers' valuations are additive, we generalize an existing mechanism to production-cost markets in an approximation-preserving way. We then show that the resulting mechanism is cost-monotone and thus can be converted into an 8-approximation mechanism for two-sided markets.

scholarly journals Multi-Unit Bilateral Trade

2019 ◽  
Vol 33 ◽  
pp. 1973-1980
Author(s):  
Matthias Gerstgrasser ◽  
Paul W. Goldberg ◽  
Bart De Keijzer ◽  
Philip Lazos ◽  
Alexander Skopalik
Keyword(s):  
Social Welfare ◽  
Finite Number ◽  
Bilateral Trade ◽  
Dominant Strategy ◽  
Specific Class ◽  
Single Item ◽  
Incentive Compatible ◽  
Ex Post ◽  
Strategy Incentive

We characterise the set of dominant strategy incentive compatible (DSIC), strongly budget balanced (SBB), and ex-post individually rational (IR) mechanisms for the multi-unit bilateral trade setting. In such a setting there is a single buyer and a single seller who holds a finite number k of identical items. The mechanism has to decide how many units of the item are transferred from the seller to the buyer and how much money is transferred from the buyer to the seller. We consider two classes of valuation functions for the buyer and seller: Valuations that are increasing in the number of units in possession, and the more specific class of valuations that are increasing and submodular.Furthermore, we present some approximation results about the performance of certain such mechanisms, in terms of social welfare: For increasing submodular valuation functions, we show the existence of a deterministic 2-approximation mechanism and a randomised e/(1 − e) approximation mechanism, matching the best known bounds for the single-item setting.

Efficient Constrained Combinatorial Auctions

2016 ◽  
Vol 18 (03) ◽  
pp. 1650007
Author(s):  
Anat Lerner ◽  
Rica Gonen
Keyword(s):  
Necessary Conditions ◽  
Dominant Strategy ◽  
Single Item ◽  
Constrained Efficiency ◽  
Incentive Compatible ◽  
Sufficient And Necessary Conditions ◽  
Multidimensional Types ◽  
The Individual ◽  
Efficient Mechanisms

The seminal work by Green and Laffont [(1977) characterization of satisfactory mechanisms for the revelation of preferences for public goods, Econometrica 45, 427–438] shows that efficient mechanisms with Vickrey–Clarke–Groves prices satisfy the properties of dominant-strategy incentive compatible (DSIC) and individually rational in the quasilinear utilities model. Nevertheless in many real-world situations some players have a gap between their willingness to pay and their ability to pay, i.e., a budget. We show that once budgets are integrated into the model then Green and Laffont’s theorem ceases to apply. More specifically, we show that even if only a single player has budget constraints then there is no deterministic efficient mechanism that satisfies the individual rationality and DSIC properties. Furthermore, in a quasilinear utilities model with [Formula: see text] nonidentical items and [Formula: see text] players with multidimensional types, we characterize the sufficient and necessary conditions under which Green and Laffont’s theorem holds in the presence of budget-constrained players. Interestingly our characterization is similar in spirit to that of Maskin [(2000) Auctions, development and privatization: Efficient auctions with liquidity-constrained buyers, Eur. Econ. Rev. 44, 667–681] for Bayesian single-item constrained-efficiency auctions.

scholarly journals Mechanism design without quasilinearity

2020 ◽  
Vol 15 (2) ◽  
pp. 511-544 ◽  
Author(s):  
Tomoya Kazumura ◽  
Debasis Mishra ◽  
Shigehiro Serizawa
Keyword(s):  
Mechanism Design ◽  
Dominant Strategy ◽  
Monotonicity Property ◽  
Allocation Rule ◽  
Type Space ◽  
Outside Option ◽  
Incentive Compatible ◽  
Type Spaces ◽  
Good Provision ◽  
Strategy Incentive

This paper studies a model of mechanism design with transfers where agents' preferences need not be quasilinear. In such a model, (i) we characterize dominant strategy incentive compatible mechanisms using a monotonicity property, (ii) we establish a revenue uniqueness result (for every dominant strategy implementable allocation rule, there is a unique payment rule that can implement it), and (iii) we show that every dominant strategy incentive compatible, individually rational, and revenue‐maximizing mechanism must charge zero payment for the worst alternative (outside option). These results are applicable in a wide variety of problems (single object auction, multiple object auction, public good provision, etc.) under suitable richness of type space. In particular, our results are applicable to two important type spaces: (a) type space containing an arbitrarily small perturbation of quasilinear type space and (b) type space containing all positive income effect preferences.

scholarly journals Limitations of Incentive Compatibility on Discrete Type Spaces

2020 ◽  
Vol 34 (02) ◽  
pp. 2136-2143
Author(s):  
Taylor Lundy ◽  
Hu Fu
Keyword(s):  
Convex Hull ◽  
Incentive Compatibility ◽  
Dominant Strategy ◽  
Negative Answer ◽  
Incentive Compatible ◽  
Type Spaces ◽  
Strategy Incentive ◽  
Discrete Type

In the design of incentive compatible mechanisms, a common approach is to enforce incentive compatibility as constraints in programs that optimize over feasible mechanisms. Such constraints are often imposed on sparsified representations of the type spaces, such as their discretizations or samples, in order for the program to be manageable. In this work, we explore limitations of this approach, by studying whether all dominant strategy incentive compatible mechanisms on a set T of discrete types can be extended to the convex hull of T.Dobzinski, Fu and Kleinberg (2015) answered the question affirmatively for all settings where types are single dimensional. It is not difficult to show that the same holds when the set of feasible outcomes is downward closed. In this work we show that the question has a negative answer for certain non-downward-closed settings with multi-dimensional types. This result should call for caution in the use of the said approach to enforcing incentive compatibility beyond single-dimensional preferences and downward closed feasible outcomes.

Dictatorial Mechanisms in Constrained Combinatorial Auctions

2013 ◽  
Vol 13 (1) ◽  
pp. 363-380 ◽  
Author(s):  
Anat Lerner ◽  
Rica Gonen
Keyword(s):  
Dominant Strategy ◽  
Combinatorial Auctions ◽  
Budget Constraints ◽  
Basic Properties ◽  
Incentive Compatible ◽  
Private Values ◽  
Multidimensional Types ◽  
Possibility Space ◽  
Pareto Efficient ◽  
Strategy Incentive

AbstractWe study the possibility space of deterministic, dominant-strategy incentive compatible, individually rational, and Pareto efficient combinatorial auctions in a model with two players and two nonidentical items (four outcomes). Our model has multidimensional types, private values, nonnegative prices, and quasilinear preferences for the players with one relaxation – the players are subject to publicly known budget constraints. We show that the space we study essentially includes one type of mechanisms: autocratic mechanisms (a form of dictatorship). Furthermore, we prove that there are families of autocratic mechanisms that uniquely fulfill the basic properties of deterministic, dominant-strategy incentive compatible, individually rational, and Pareto efficient. The mechanisms in the autocratic families are identical except for two to three price parameters that differentiate them.

Autocratic Mechanisms: A Form of Dictatorship in Constrained Combinatorial Auctions

2015 ◽  
Vol 17 (04) ◽  
pp. 1550010 ◽  
Author(s):  
Anat Lerner ◽  
Rica Gonen
Keyword(s):  
Pareto Optimality ◽  
Dominant Strategy ◽  
Combinatorial Auctions ◽  
Pareto Optimal ◽  
Basic Properties ◽  
Incentive Compatible ◽  
Welfare Maximization ◽  
Private Values ◽  
Multidimensional Types ◽  
Strategy Incentive

We characterize the space of deterministic, dominant-strategy incentive compatible, individually rational, and Pareto-optimal combinatorial auctions where efficiency is not required. We examine a model with two players and k nonidentical items (2k outcomes), multidimensional types, private values, non-negative prices, and quasilinear preferences for the players with one relaxation — the players are subject to publicly-known budget constraints. We show that if it is publicly known that the players value the bundles more than the smaller of their budgets then the studied space includes one type of mechanism: autocratic mechanisms (a form of dictatorship). Furthermore, we prove that there are families of autocratic mechanisms that uniquely fulfill the basic properties of deterministic, dominant-strategy incentive compatible, individually rational, and Pareto-optimal. Interestingly the above basic properties are a weaker requirement than it may initially appear, as the property of Pareto optimality in our model of budget-constrained players and non-negative prices do not coincide with welfare maximization, i.e., efficiency as such is a much weaker requirement.

The randomized communication complexity of revenue maximization

2021 ◽  
Vol 19 (2) ◽  
pp. 75-83
Author(s):  
Aviad Rubinstein ◽  
Junyao Zhao
Keyword(s):  
Lower Bounds ◽  
Communication Complexity ◽  
Social Choice Rule ◽  
Valuation Function ◽  
Optimal Auctions ◽  
Incentive Compatible ◽  
First Approximation ◽  
Exponential Separation ◽  
Open Question

We study the communication complexity of incentive compatible auction-protocols between a monopolist seller and a single buyer with a combinatorial valuation function over n items [Rubinstein and Zhao 2021]. Motivated by the fact that revenue-optimal auctions are randomized [Thanassoulis 2004; Manelli and Vincent 2010; Briest et al. 2010; Pavlov 2011; Hart and Reny 2015] (as well as by an open problem of Babaioff, Gonczarowski, and Nisan [Babaioff et al. 2017]), we focus on the randomized communication complexity of this problem (in contrast to most prior work on deterministic communication). We design simple, incentive compatible, and revenue-optimal auction-protocols whose expected communication complexity is much (in fact infinitely) more efficient than their deterministic counterparts. We also give nearly matching lower bounds on the expected communication complexity of approximately-revenue-optimal auctions. These results follow from a simple characterization of incentive compatible auction-protocols that allows us to prove lower bounds against randomized auction-protocols. In particular, our lower bounds give the first approximation-resistant, exponential separation between communication complexity of incentivizing vs implementing a Bayesian incentive compatible social choice rule, settling an open question of Fadel and Segal [Fadel and Segal 2009].

scholarly journals Aplikasi Metode Simpleks Pada Optimalisasi Biaya Bahan Baku (Studi Kasus: Ukm Najmah Klappertart)

2020 ◽  
Vol 17 (2) ◽  
pp. 129-140
Author(s):  
D Damayanti ◽  
A I Jaya ◽  
Resnawati
Keyword(s):  
Simplex Method ◽  
Production Cost ◽  
Production Costs ◽  
Optimal Production ◽  
Total Cost ◽  
Optimal Cost ◽  
Cost Of Production ◽  
The Cost

ABSTRACT The purpose of this research is to obtain an the optimal production costs of Klappertart based on the basic ingredients comparing the production cost of Klappertart in Najmah Klappertart with production costs using the simplex method. The result showed that the optimal costs is ,-. This result is equal to the total cost of klappertart by SMEs Najmah Klappertart, so it can be concluded that the cost of production klappertart based on the basic ingredients on SMEs Najmah Klappertart were optimal. Keywords      : Optimal Cost, Basic Ingredients, Production Costs. (A-Z), Simplex Method  

scholarly journals Two-Period Inventory Control with Manufacturing and Remanufacturing under Return Compensation Policy

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Xiaochen Sun ◽  
Mengmeng Wu ◽  
Fei Hu
Keyword(s):  
Production Cost ◽  
Raw Material ◽  
Planning Problem ◽  
Compensation Policy ◽  
Optimal Production ◽  
Inventory Replenishment ◽  
Numerical Studies ◽  
Production Policy ◽  
Production Planning Problem ◽  
Primary Problem

As an effective way of decreasing production cost, remanufacturing has attracted more and more attention from firms. However, it also brings many difficulties to firms, especial when firms remanufacture products which they produce. A primary problem for the case is how to acquire the used product sold by the firm itself. In this paper, we consider a return compensation policy for acquiring used product from customers. Under this policy, the return quantity of used product is a proportion of demand. We study an inventory replenishment and production planning problem for a two-period inventory system with dependent return and demand. We formulate the problem into a three-stage stochastic programming problem, where the firm needs to make decisions on the replenishment quantity of new raw material inventory in each period and the production quantities of manufacturing and remanufacturing ways. We give the optimal production policy of manufacturing and remanufacturing ways for the realized demand and prove the objective function for each stage to be concave in the inventory replenishment quantity. Moreover, we prove that the basic inventory policy is still optimal for each period and give the analytical conditions of the optimal inventory levels which are unrelated to acquisition price. Finally, we investigate numerical studies to analyze managerial insights.

Sign in / Sign up

Export Citation Format

Share Document