Skip to main content
Log in

Optimal selling strategies when buyers name their own prices

  • Published:
Quantitative Marketing and Economics Aims and scope Submit manuscript

Abstract

This paper models a name-your-own-price (NYOP) retailer who allows buyers to initiate their retail interactions by describing a product and submitting a binding bid for it. The buyers have an outside option to buy the same good for a commonly known posted price that also acts as an informative upper bound on the cost the NYOP retailer faces. We conceptualize a selling strategy of such an NYOP retailer to be the probability that a buyer’s bid gets accepted. The selling strategy is a function of only the bid level; it does not depend on the particular realization of the retailer’s procurement cost. Using mechanism-design techniques, we characterize the optimal selling strategy and the equilibrium bidding function that best responds to it. We show that the optimal strategy implements the first-best ex-post optimal mechanism: for every cost realization, the retailer can make as much profit as he would if he could learn his cost first and use the optimal mechanism contingent on it. The complexity involved in credibly communicating an entire bid-acceptance function to buyers can make the first-best strategy impractical in some real-world markets, so we also analyze several simpler NYOP strategies: setting a minimum bid, charging a participation fee, and accepting all bids above cost. We find that under many scenarios, the minimum-bid strategy dominates the other simpler strategies and achieves a majority of the maximal profit improvement available from the first best strategy. However, NYOP retailers in thin markets can do better by charging participation fees than by setting minimum bids.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Notes

  1. Amaldoss and Jain 2008; Fay 2009; Wang et al. 2009, and others. Please see Anderson and Wilson (2011) for a review of analytical approaches to modeling NYOP selling.

  2. Priceline makes its offering opaque (Fay 2008) by hiding the airline name and exact time of departure. Other retailers, e.g., byopoly.com, prisminister.dk, or chiching.com, do not make the products opaque. We abstract away from opacity in this paper because it is an orthogonal issue. Please contact the authors for the optimal strategy when the retailer’s offering is opaque but the outside market is transparent.

  3. Several existing models make an analogous assumption, e.g. Amaldoss and Jain (2008) or Spann et al. (2010).

  4. Posted pricing would be the optimal cost-contingent mechanism for such a retailer (Riley and Zeckhauser 1983).

  5. Because the two competitors are selling the same object, Bertrand competition would result if the outside competitor responded. To prevent a complete collapse of profits, we could introduce horizontal differentiation arising from heterogeneity in buyer inherent preference for NYOP over posted pricing similar to Hann and Terwiesch (2003) or Fay (2009). Within such a larger model, our paper characterizes what the NYOP best response would look like.

  6. The underlying assumption is that the NYOP retailer does not have a special technology for producing the object, but rather obtains the object from the same supplier as his posted-price competitors. Even after learning the posted price, uncertainty about c remains because p is a relatively stable price, set to reflect long-run revenue-management considerations and quite possibly a larger set of customers (as in Spann et al. 2010).

  7. Note the FOC characterization of passive selling requires additional assumptions about H compared to the first best mechanism. One standard regularity assumption equivalent to the Myerson regularity discussed earlier in this paper is that c + H(c)/h(c) is monotonically increasing in c.

  8. Concavity of H(b)(x − b)on the same interval is sufficient but not necessary for this.

References

  • Amaldoss, & Jain. (2008). Joint bidding in the name-your-own-price channel: a strategic analysis. Management Science, 54(10), 1685–1699.

    Article  Google Scholar 

  • Anderson, C. (2009). Setting prices on priceline. Interfaces, 39(4), 307–315.

    Article  Google Scholar 

  • Anderson, C., & Wilson, J. G. (2011). Name-your-own price auction mechanisms – modeling and future implications. Journal of Revenue and Pricing Management, 10, 32–39.

    Article  Google Scholar 

  • Becker, G. M., DeGroot, M. H., & Marschak, J. (1964). Measuring utility by a single-response sequential method. Behavioral Science, 9(3), 226–232.

    Article  Google Scholar 

  • Chen, C.-H. (2012). Name Your Own Price at Priceline.com: Strategic Bidding and Lockout Periods. Review of Economic Studies. published online 2012.

  • Chernev, A. (2003). Reverse pricing and online price elicitation strategies in consumer choice. Journal of Consumer Psychology, 13, 51–62.

    Article  Google Scholar 

  • Ding, M., Eliashberg, J., Huber, J., & Saini, R. (2005). Emotional bidders: an analytical and experimental examination of consumers’ behavior in a priceline-like reverse auction. Management Science, 51(3), 352–364.

    Article  Google Scholar 

  • Fay, S. (2004). Partial-repeat-bidding in the name-your-own-price channel. Marketing Science, 23(3), 407–418.

    Article  Google Scholar 

  • Fay, S. (2008). Selling an opaque product through an intermediary: the case of disguising one’s product. Journal of Retailing, 84(1), 59–75.

    Article  Google Scholar 

  • Fay, S. (2009). Competitive reasons for the name-your-own-price channel. Marketing Letters, 20, 277–293.

    Article  Google Scholar 

  • Guerre, E., Perrigne, I., & Vuong, Q. (2000). Optimal nonparametric estimation of first-price auctions. Econometrica, 68(3), 525–574.

    Article  Google Scholar 

  • Hann, I.-H., & Terwiesch, C. (2003). Measuring the frictional costs of online transactions: the case of a name-your-own-price channel. Management Science, 49(11), 1563–1579.

    Article  Google Scholar 

  • Krishna, V. (2002). Auction theory. London: Academic Press of Elsevier Science.

    Google Scholar 

  • Myerson, R. B. (1981). Optimal auction design. Mathematics of Operations Research, 6(1), 58–73.

    Article  Google Scholar 

  • Riley, J., & Zeckhauser, R. (1983). Optimal selling strategies: when to haggle, when to hold firm. Quarterly Journal of Economics, 98(2), 267–289.

    Article  Google Scholar 

  • Shapiro, D. (2011). Profitability of name your own price mechanisms in the case of risk-averse buyers. Marketing Science, 30(2), 290–304.

    Article  Google Scholar 

  • Shapiro, D., & Shi, X. (2008). Market segmentation: the role of opaque travel agencies. Journal of Economics & Management Strategy, 17(4), 803–837.

    Article  Google Scholar 

  • Shapiro, D., & Zillante, A. (2009). Naming your own price mechanisms: revenue gain or drain? Journal of Economic Behavior and Organization, 72, 725–737.

  • Spann, M., & Tellis, G. J. (2006). Does the internet promote better consumer decisions? Case of name-your-own-price auctions. Journal of Marketing, 70(1), 65–78.

    Article  Google Scholar 

  • Spann, M., Zeithammer, R., & Haübl, G. (2010). Optimal reverse-pricing mechanisms. Marketing Science, 29(6), 1058–1070.

    Article  Google Scholar 

  • Spann, M., Haübl, G., Skiera, B., & Bernhardt, M. (2012). Bid-Elicitation Interfaces and bidding behavior in retail interactive pricing. Journal of Retailing, 88(1), 131–144.

    Article  Google Scholar 

  • Spann, M., Zeithammer, R., & Haübl, G. (2015). Erratum to “optimal reverse-pricing mechanisms”. Marketing Science, 34(2), 297–299.

    Article  Google Scholar 

  • Vickrey, W. (1961). Counterspeculation, auctions, and competitive sealed tenders. Journal of Finance, 16(1), 8–37.

    Article  Google Scholar 

  • Wang, T., Gal-Or, E., & Chatterjee, R. (2009). The name-your-own-price channel in the travel industry. Management Science, 55(6), 968–979.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Robert Zeithammer.

Appendix: notation table and proofs of propositions

Appendix: notation table and proofs of propositions

Table 1 Notation

Proof of proposition 1

Let m(x) be the expected payment by a buyer with valuation x. From risk neutrality, the utility of a buyer x who reports type z is U(x) = xq(z) − m(z), and standard incentive-compatibility arguments (see Myerson 1981 for details) imply the expected payment is the following function of q(x):

$$ m(x)=m(0)+xq(x)-{\displaystyle \underset{0}{\overset{x}{\int }}q(t)dt} $$
(IC)

When (IC) does not hold, the buyers do not have the incentive to report their x truthfully.

Consider the direct-revelation retailer who can set an arbitrary bid-acceptance rule π(x, c). Plugging the implied bid-acceptance rule \( q(x)={\displaystyle \underset{0}{\overset{p}{\int }}\pi \left(x,c\right)dH(c)} \)into (IC) implies that on average over all c, such a retailer receives a payment of

$$ m(x)=m(0)+x{\displaystyle \underset{0}{\overset{p}{\int }}\pi \left(x,c\right)dH(c)}-{\displaystyle \underset{\underline{x}}{\overset{x}{\int }}{\displaystyle \underset{0}{\overset{p}{\int }}\pi \left(t,c\right)dH(c)dt}} $$
(A1)

Note the rule π can use c as an input, so the retailer can set the rule for all possible c levels upfront. However, the buyers do not know c at the time of submitting their bids, so incentive compatibility only restricts the average payment of a given buyer type. Because all buyers with x≥p pay m(p), the expected profit of the retailer is

$$ \begin{array}{l}\varPi \left(\pi \right)= \Pr \left(x<p\right)\left({E}_{x\Big|x<p}\left[m(x)\right]-{E}_{c,x\Big|x\le p}\left[c\pi \left(x,c\right)\right]\right)\\ {}\kern2em +\left[1- \Pr \left(x<p\right)\right]\left[m(p)-{E}_c\left[c\pi \left(p,c\right)\right]\right]\end{array} $$
(A2)

Plugging the m function from (A1) into the profit expression (A2) yields

\( \begin{array}{l}\varPi \left(\pi \right)=m(0)+{\displaystyle \underset{\underline{x}}{\overset{p}{\int }}x{\displaystyle \underset{0}{\overset{p}{\int }}\pi \left(x,c\right)dH(c)dF(x)}}-{\displaystyle \underset{\underline{x}}{\overset{p}{\int }}{\displaystyle \underset{0}{\overset{x}{\int }}{\displaystyle \underset{0}{\overset{p}{\int }}\pi \left(t,c\right)dH(c) dtdF(x)}}}-{\displaystyle \underset{\underline{x}}{\overset{p}{\int }}{\displaystyle \underset{0}{\overset{p}{\int }}c\pi \left(x,c\right)dH(c)dF(x)}}\\ {}\kern4em +\left[1-F(p)\right]\left[p{\displaystyle \underset{0}{\overset{p}{\int }}\pi \left(p,c\right)dH(c)-{\displaystyle \underset{0}{\overset{p}{\int }}{\displaystyle \underset{0}{\overset{p}{\int }}\pi \left(t,c\right)dH(c)dt}}}-{\displaystyle \underset{0}{\overset{p}{\int }}c\pi \left(p,c\right)dH(c)}\right]\kern4em (A3)\end{array} \)where the second row corresponds to the profit from high buyers (x≥p), and the last term in each row is the expected cost of goods sold.

As in other mechanism-design settings, the term \( {\displaystyle \underset{\underline{x}}{\overset{p}{\int }}{\displaystyle \underset{0}{\overset{x}{\int }}{\displaystyle \underset{0}{\overset{p}{\int }}\pi \left(t,c\right)dH(c) dtdF(x)}}} \) in the first row can be simplified by first changing the order of integration from c,t,x to x,t,c, and noting that π(t, c) does not depend on x:

$$ \begin{array}{l}{\displaystyle \underset{\underline{x}}{\overset{p}{\int }}{\displaystyle \underset{0}{\overset{x}{\int }}\pi \left(t,c\right) dtdF(x)}}={\displaystyle \underset{0}{\overset{p}{\int }}\left(\pi \left(t,c\right){\displaystyle \underset{t}{\overset{p}{\int }}dF(x)}\right)dt}=\\ {}={\displaystyle \underset{0}{\overset{p}{\int }}\pi \left(t,c\right)\left[F(p)-F(t)\right]dt}={\displaystyle \underset{\underline{x}}{\overset{p}{\int }}\pi \left(x,c\right)\left(\frac{F(p)-F(x)}{f(x)}\right)dF(x)}\end{array} $$
(A4)

where the last equality simply renames the t variable as x and changes variables. Finally, change the order of integration to be first over x and then over c throughout, and collect terms:

$$ \begin{array}{l}\varPi \left(\pi \right)=m(0)+{\displaystyle \underset{0}{\overset{p}{\int }}{\displaystyle \underset{\underline{x}}{\overset{p}{\int }}\left(x-\frac{F(p)-F(x)}{f(x)}-c\right)\pi \left(x,c\right)dF(x)dH(c)}}+\\ {}+\left[1-F(p)\right]\left[{\displaystyle \underset{0}{\overset{p}{\int }}\left(p-c\right)\pi \left(p,c\right)dH(c)}\right]-\left[1-F(p)\right]{\displaystyle \underset{0}{\overset{p}{\int }}{\displaystyle \underset{\underline{x}}{\overset{p}{\int }}\pi \left(x,c\right) dxdH(c)}}\end{array} $$
(A5)

The last term in (A5) is the expected surplus of the high buyers (x≥p). It obviously depends on the allocation rule for all x≤p, and after rewriting it as \( {\displaystyle \underset{0}{\overset{p}{\int }}{\displaystyle \underset{\underline{x}}{\overset{p}{\int }}\pi \left(x,c\right)\left(\frac{1-F(p)}{f(x)}\right)dF(x)dH(c)}} \), we can incorporate it into the first row of (A5) to result in (Standard individual rationality arguments also imply m(0)=0):

$$ \varPi \left(\pi \right)={E}_c\left[{\displaystyle \underset{\underline{x}}{\overset{p}{\int }}\left(x-\frac{1-F(x)}{f(x)}-c\right)\pi \left(x,c\right)dF(x)+\left[1-F(p)\right]\left(p-c\right)\pi \left(p,c\right)}\right] $$
(A6)

Equation (A6) implies the retailer profit is as if all high customers paid p and all low customers delivered the same profit they would in the absence of the posted-price competitor. In other words, the surplus of high-value buyers implied by the IC constraint affects the payments of low-value buyers exactly as it would in the absence of the posted-price competitor.

The optimal allocation rule is obvious, and it maximizes the expected profit pointwise:

$$ \pi \left(x,c\right)=1\iff \left(x<p\ \mathrm{and}\ c<x-\frac{1-F(x)}{f(x)}\right)\ \mathrm{or}\ x=p $$
(A7)

To see the optimality of always selling to high-value buyers with x=p, note that although the term π(p, c)appears in (A6) twice, its impact on profits inside the integral is measure zero, whereas its impact on profits in the [1 − F(p)](p − c)π(p, c) term has positive measure.

To derive the c-contingent profit shown in the proposition, use integration by parts to show that \( \left[1-F(p)\right]\left(p-c\right)={\displaystyle \underset{p}{\overset{\overline{x}}{\int }}\left(\psi (x)-c\right)dF(x)} \), and verify that the right-hand expression results when we plug A7 into the expression in the large square brackets in A6. QED Prop 1

Proof of Lemma 1

Because q(x) = U′(x),\( {\beta}^{\prime }(x)=\frac{U(x){U}^{{\prime\prime} }(x)}{{\left({U}^{\prime }(x)\right)}^2}>0\iff {U}^{{\prime\prime} }(x)>0\iff {q}^{\prime }(x)>0 \). From Proposition 1, q′(x) = ψ′(x)h(ψ(x)) > 0 ⇔ ψ′(x) > 0. To derive the optimal bidding function, plug q and U from Proposition 1\( q(x)={\displaystyle \underset{0}{\overset{p}{\int }}\pi \left(x,c\right)dH(c)}=H\left(\psi (x)\right) \) and \( U(x)={\displaystyle \underset{\underline{x}}{\overset{x}{\int }}q(t)dt}={\displaystyle \underset{\psi^{-1}(0)}{\overset{x}{\int }}H\left(\psi (t)\right)dt} \) into Eq. 2 :\( \beta (x)={\displaystyle \underset{\psi^{-1}(0)}{\overset{x}{\int }}t\frac{dH\left(\psi (t)\right)}{H\left(\psi (x)\right)}}={\displaystyle \underset{0}{\overset{\psi (x)}{\int }}{\psi}^{-1}(c)\frac{dH(c)}{H\left(\psi (x)\right)}}=E\left[\left.{\psi}^{-1}\left(\mathrm{cost}\right)\right|{\psi}^{-1}\left(\mathrm{cost}\right)<x\right] \), where the second equality follows from a change in variables c = ψ(z). QED Lemma 1

Proof of Lemma 2

To be incentive compatible, β(p)must satisfy, for every x<p:

$$ \begin{array}{l}p-\beta (p)\ge A\left(\beta (x)\right)\left(p-\beta (x)\right)\kern2em (IC1)\\ {}U(x)\ge x-\beta (p)\kern8em (IC2)\end{array} $$

where the first inequality(IC1) ensures type p bids β(p) and the second inequality (IC2)ensures types x<p do not deviate to β(p). The deviation surplus for type p is

$$ A\left(\beta (x)\right)\left(p-\beta (x)\right)=H\left(\psi (x)\right)\left(p-{\displaystyle \underset{0}{\overset{\psi (x)}{\int }}{\psi}^{-1}(w)\frac{h(w)}{H\left(\psi (x)\right)}dw}\right)={\displaystyle \underset{0}{\overset{\psi (x)}{\int }}\left(p-{\psi}^{-1}(w)\right)dH(w)} $$

which is obviously increasing in x, so the best deviation from bidding p is to bid β p . Therefore, (IC1) reduces to \( \beta (p)\le p-{\displaystyle \underset{0}{\overset{\psi (p)}{\int }}\left(p-{\psi}^{-1}(w)\right)dH(w)}=p-{\displaystyle \underset{\psi^{-1}(0)}{\overset{p}{\int }}H\left(\psi (z)\right)dz} \). The LHS of (IC2)is the expected equilibrium surplus of type x, which Proposition 1 pins down as \( U(x)={\displaystyle \underset{\psi^{-1}(0)}{\overset{x}{\int }}H\left(\psi (t)\right)dt} \). Therefore, (IC2)is \( \beta (p)\ge p-{\displaystyle \underset{\psi^{-1}(0)}{\overset{p}{\int }}H\left(\psi (z)\right)dz} \) because \( x-{\displaystyle \underset{\psi^{-1}(0)}{\overset{x}{\int }}H\left(\psi (z)\right)dz} \) is increasing in x. Therefore, the two incentive-compatibility constraints together uniquely determine the bid of type p as\( \beta (p)=p-{\displaystyle \underset{\psi^{-1}(0)}{\overset{p}{\int }}H\left(\psi (z)\right)dz} \). It is easy to show that the invertibility constraint β(p) > β p is always satisfied. QED Lemma 2

Proof of Lemma 3

The upper bound on probability acceptance must simply satisfy, for every x,

A(b)(x − b) ≤ H(ψ(x))(x − β(x))

The RHS is maximized by x=p, so using the same arguments as in the proof of Lemma 2, the constraint is thus \( \begin{array}{cc}\hfill A(b)\le \left(\frac{1}{p-b}\right){\displaystyle \underset{\psi^{-1}(0)}{\overset{p}{\int }}H\left(\psi (z)\right)dz}\hfill & \hfill QED\ Lemma3\hfill \end{array} \)

Proof of Proposition 4

The expected profit of a retailer who uses a participation fee such that buyers with x ≥ x e enter solves the following problem:

$$ {x}_e=\underset{z}{ \arg \max}\left[1-F(z)\right]\underset{S(z) \equiv \mathrm{expected}\ \mathrm{surplus}\ \mathrm{of}z}{\underbrace{H\left({\beta}_0(z)\right)\left(z-{\beta}_0(z)\right)}}+{\displaystyle \underset{z}{\overset{1}{\int }}{\pi}_0\left( \min \left(x,p\right)\right)dF(x)} $$

where \( {\pi}_0(x)={\displaystyle \underset{0}{\overset{\beta_0(x)}{\int }}\left({\beta}_0(x)-c\right)dH(c)}=H\left({\beta}_0(x)\right)\left[{\beta}_0(x)-E\left(\left.c\right|c<{\beta}_0(x)\right)\right] \)is the expected profit from a buyer with valuation x. The envelope theorem implies S′(z) = H(β 0(z)), so the FOC of the retailer’s problem is [1 − F(x e )]H(β 0(x e )) = f(x e )[S(x e ) + π 0(x e )].

In words, raising the fee increases the payment of everyone above the entry threshold (LHS) while decreasing the number of entrants, which results in a marginal loss of the fee and bidding profit (RHS). In other words, the RHS is the marginal loss of the gains from trade, because the H(β 0(x e ))β 0(x e ) cancels out in S(x e ) + π 0(x e ):

[1 − F(x e )]H(β 0(x e )) = f(x e )H(β 0(x e ))[x e  − E(c|c < β 0(x e ))]

Both sides of the FOC are weighted by H(β 0(x e ))because no trade occurs when c > β 0(x e ). Canceling out the weights results in the final FOC equation: ψ(x e ) = E(c|c < β 0(x e )). QED

Proof of Proposition 5

For p<2/3, the relative profit advantage of the first-best strategy over the minimum-bid strategy is \( {\varPi}_A(p)-{\varPi}_m(p)=\frac{{\left(2p-1\right)}^3}{12p}\to 0\ \mathrm{a}\mathrm{s}\ p\ \mathrm{a}\mathrm{pproaches}\ \frac{1}{2}. \)

  • Claim a): Let Δ(p) = Π * m (p) − Π * e (p). There are three regions of p: First, for \( p<\frac{4}{7} \), \( \varDelta (p)=\frac{p\left(1-p\right)}{8}>0 \) and obviously decreasing in p. Second, for \( \frac{4}{7}<p<\frac{2}{3} \), Δ(p) is decreasing on the interval because \( {\varDelta}^{\prime}\left(\frac{4}{7}\right)=-\frac{1}{56}<0 \) and \( {\varDelta}^{{\prime\prime} }(p)=-\frac{5}{6}-\frac{8}{147{p}^3}<0 \), and Δ(p) > 0 because and \( \varDelta \left(\frac{2}{3}\right)=\frac{127}{5292}>0 \) and Δ(p) is decreasing. Third, for \( p>\frac{2}{3} \), Δ(p) is decreasing on the interval because \( {\varDelta}^{\prime }(1)=-\frac{55}{10584}<0 \) and \( {\varDelta}^{{\prime\prime} }(p)=\frac{1}{6}+\frac{124}{1323{p}^3}>0 \), and Δ(p) > 0because \( \varDelta (1)=\frac{55}{10584}>0 \) and Δ(p) is decreasing.

  • Claim b): The equivalence for \( p\le \frac{2}{3} \) is obvious from both strategies charging p. The dominance for \( p>\frac{2}{3} \) follows from \( {\varPi}_m^{*}(p)-{\varPi}_{fix}^{*}(p)=\frac{2}{27p}-{\left(\frac{1-E(c)}{2}\right)}^2=\frac{\left(8-3p\right){\left(3p-2\right)}^2}{432p}>0 \).

  • Claim c): Let Δ(p) = Π * fix (p) − Π * e (p). Consider \( p>\frac{2}{3} \), where \( \varDelta (p)=\frac{1}{4}-\frac{4}{147p}-\frac{3p}{8}+\frac{7{p}^2}{48} \). We see that \( \varDelta (1)=-\frac{5}{784}<0 \) and \( \varDelta \left(\frac{2}{3}\right)=\frac{127}{5292}>0 \), so there must be at least one p* s.t. Δ(p *) = 0. To prove uniqueness, note Δ(p) is decreasing on the interval because \( {\varDelta}^{\prime }(1)=-\frac{11}{196}<0 \) and \( {\varDelta}^{{\prime\prime} }(p)=\frac{7}{24}-\frac{8}{147{p}^3}>0 \).

  • Claim d): Given the ranking established in a)-c), it is enough to show the passive strategy is strictly less profitable than the participation-fee strategy for all p and the fixed-price strategy for\( p>\frac{2}{3} \). The former follows from \( {\varPi}_e^{*}(p)-{\varPi}_0(p)=\left\{\begin{array}{c}\hfill p<\frac{4}{7}:\frac{p\left(6-7p\right)}{24}>0\hfill \\ {}\hfill p\ge \frac{4}{7}:\frac{4}{147p}>0\kern2em \hfill \end{array}\right. \). The latter follows from \( {\varPi}_{fix}^{*}(p)-{\varPi}_0(p)=\frac{12-p\left(18-7p\right)}{48} \), which is decreasing for \( p>\frac{2}{3} \) and positive at p=1.

  • QED Proposition 5.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zeithammer, R. Optimal selling strategies when buyers name their own prices. Quant Mark Econ 13, 135–171 (2015). https://doi.org/10.1007/s11129-015-9157-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11129-015-9157-y

Keywords

Navigation