Combinatorial Auctions via Posted Prices
Abstract
We study anonymous posted price mechanisms for combinatorial auctions in a Bayesian framework. In a posted price mechanism, item prices are posted, then the consumers approach the seller sequentially in an arbitrary order, each purchasing her favorite bundle from among the unsold items at the posted prices. These mechanisms are simple, transparent and trivially dominant strategy incentive compatible (DSIC).
We show that when agent preferences are fractionally subadditive (which includes all submodular functions), there always exist prices that, in expectation, obtain at least half of the optimal welfare. Our result is constructive: given blackbox access to a combinatorial auction algorithm , sample access to the prior distribution, and appropriate query access to the sampled valuations, one can compute, in polytime, prices that guarantee at least half of the expected welfare of . As a corollary, we obtain the first polytime (in and ) constantfactor DSIC mechanism for Bayesian submodular combinatorial auctions, given access to demand query oracles. Our results also extend to valuations with complements, where the approximation factor degrades linearly with the level of complementarity.
1 Introduction
The canonical problem in market design is to efficiently allocate a set of resources among a set of selfinterested agents. Such allocation problems range in scope from the trade of a single item between a seller and a buyer, to combinatorial auctions in which many heterogeneous goods are to be divided among multiple participants with complex and idiosyncratic preferences. Scenarios of the latter type have attracted significant recent attention from the computer science community, due to algorithmic challenges presented by the underlying allocation problem. For example, the efficient allocation of cloud resources involves the scheduling of computing tasks, and the allocation of wireless spectrum involves finding large independent sets in graphs that represent interference constraints. The primary challenge in AGT is to marry algorithmic solutions to such problems with the economic principles that underpin market design.
As an example, take the problem of designing an incentive compatible mechanism for combinatorial auctions with submodular bidders. The underlying optimization problem is NPhard, and simple greedy methods achieve a constant approximation. On the other hand, whether there is a truthful polytime constantfactor approximation has remained a vexing and major open question for over a decade
When designing an economically viable mechanism, it is desirable to not only respect incentives and computational constraints, but also to resolve allocation decisions in a straightforward and transparent fashion. For example, a simple and natural approach is to resolve a market using posted prices. One might imagine an implementation in which items are assigned anonymous prices (i.e., all agents face the exact same prices), then agents arrive to the market and each consumes his mostdesired bundle under the given prices. Such a methodology exhibits many desirable properties: it is simple, decentralized, and easy to implement. It is also transparent in the sense that a buyer does not need to understand the pricesetting method in order to understand how to participate — he simply behaves as a pricetaker and consumes his preferred bundle. Therefore, it is also trivially incentive compatible.
Posted price mechanisms are highly applicable when markets are large and the aggregate demands of buyers can be accurately predicted. For instance, if the buyers’ valuations are public knowledge and satisfy the gross substitutes condition, then there always exist prices that efficiently clear the market [23, 29]. Similar results hold in large markets for arbitrary valuations [32]. However, if valuations are not fully known to the seller and are unpredictable, as in the submodular combinatorial auction problem described above, then it is unclear how reasonable prices can be set. This motivates the approach of implementing an optimization algorithm as an auction, where buyers submit competing bids that are treated as input. As Milgrom writes, “When goods are not standardized or when the market clearing prices are highly unstable, posted prices work poorly, and auctions are usually preferred” [33].
We are left with a dichotomy. Posted prices form a simple and natural market instrument, but they generate efficient outcomes only under special circumstances and full information over the buyers’ preferences. General auctions are more widely applicable, but can be significantly more complex to execute and participate in; moreover, we still do not have reasonable auction designs for many allocation problems of interest. A natural question arises:
To what extent can approximately efficient outcomes be implemented using anonymous posted prices in settings of incomplete information?
In this work we study the power of anonymous posted prices in Bayesian settings, where the designer knows the distribution over the agents’ valuations but not their realizations. The Bayesian setting imposes additional challenges over the full information setting typical in the market equilibrium literature. In particular, readers familiar with this literature will note that, in this probabilistic setting, there do not exist prices that are guaranteed to satisfy all agent demands simultaneously. To mitigate this problem, we consider posted price mechanisms that admit the agents sequentially, in an arbitrary order, to select their most preferred bundle from the remaining items.
We devise polytime posted price mechanisms, for several classes of valuations, that achieve nearly optimal social welfare given appropriate access to the distribution of the agents’ valuations. Specifically, for XOS valuations (a strict superset of submodular valuations) we devise a mechanism that obtains a constant fraction of the optimal social welfare. Notably, this implies that we can obtain an approximate dominant strategy incentive compatible mechanism for Bayesian XOS valuations, whose running time is polynomial in and given access to demand queries. Prior to this work, the bestknown polytime mechanisms (postedprice or otherwise) were either polylogarithmic approximations [15] or had runtimes that were polynomial in the support size of an agent’s valuation distribution, which could be exponential in and [4, 24]. In addition, for general monotone valuations, we devise a mechanism that obtains an approximation factor that degrades gracefully with the level of complementarity of the functions, as captured by the maximumoverhypergraph (MPH) hierarchy, recently introduced in [20]. A more detailed description of our results, along with a comparison to the related literature, appears below.
1.1 Our model
Our setting consists of a set of indivisible objects and a set of buyers. Each buyer has a valuation function that indicates his value for every set of objects. We assume valuations are monotone nondecreasing, normalized so that , and scaled to lie in . The profile of buyer valuations is denoted by .
An allocation of is a vector of sets , where denotes the bundle assigned to buyer , for every buyer , and for every (note that it is not required that all items are allocated). The social welfare of an allocation is , and the optimal welfare is denoted by OPT.
The utility of buyer being allocated bundle under prices is Given prices , the demand correspondence of buyer contains the sets of objects that maximize buyer ’s utility.
We consider a Bayesian setting, where the bidders’ valuations are drawn independently from distributions . Write , so that is drawn from . We think of as being public knowledge, whereas the realization is known only to agent . In the Bayesian framework, an allocation is said to be an approximation (for social welfare) if
1.2 Anonymous Posted Price Mechanisms
The posted price mechanisms considered in this paper proceed in the following steps:

(pricing phase) a price vector is determined, based on ;

(arrival order phase) an arrival order is determined;

(value realization phase) A value is realized for every buyer , known only to buyer ;

(consumption phase) The buyers arrive to the market according to the order , and each buyer receives his most desired bundle among all remaining items. That is, for every buyer , . Buyer pays the sum of item prices in his bundle .
We refer to these as anonymous posted price mechanisms, though sometimes we will leave out “anonymous” for brevity.
We note that the mechanism can be described in two equivalent ways, namely as an indirect or a direct mechanism.
In both versions, the mechanism sets the prices and determines
It is easy to verify that any posted price mechanism that adheres to this structure is trivially dominant strategy incentive compatible (DSIC). Moreover, it is clearly weakly group strategyproof, meaning that no coalition of agents can deviate in a way that strictly benefits each one of them.
All of our results hold regardless of the order selected in the arrival order phase, so we can think of the arrival order as being chosen adversarially. In the direct revelation implementation it would be natural to imbue the mechanism with the power to choose the ordering, but we view obliviousness to the order as increasing the robustness of the mechanism.
Beyond the strong incentive characteristics of posted price mechanisms, they are appealing in their simplicity. In particular, they proceed by setting a single price vector and using it for all agents.
1.3 Our results
We establish welfare guarantees for XOS (i.e., fractionally subadditive) valuations (a strict superset of submodular valuations), and for MPH valuations — a hierarchy that spans all monotone valuations, parameterized by the complementarity level . Our main contribution is the following:
Theorem: [2approximation for XOS] Given blackbox access to an algorithm for XOS valuations, sample access to distributions , an query oracle for the valuations in the support of , and a demand oracle for the valuations, there exists a posted price mechanism that, for every XOS valuation profile , and every , returns an outcome that gives expected social welfare of at least , and runs in time .
We note that the factor of 2 is tight (even for a single item), as established by the illustrating example in the end of this section. We also note that the demand oracle requirement is needed only for simulating agent behavior in the consumption phase. This theorem implies a set of results for XOS valuations and special cases thereof, including submodular and gross substitutes valuations. Before presenting the corollaries, we wish to emphasize the strengths of this result in light of the previous literature:

(Truly) polytime: Many previous mechanisms have (essentially) pseudopolynomial runtime, in the sense that they are polynomial in the size of the agents’ type space, which may plausibly be exponential in and . The runtime of our mechanisms is polynomial in and , independent of the type space sizes.

DSIC: Many existing mechanisms for settings of incomplete information exhibit the weaker notion of Bayesian incentive compatibility (BIC). Our mechanism exhibits the stronger notion of DSIC, and is also weakly group strategyproof.
The heart of the construction of our mechanism lies in the appropriate price assignment; this is the part where oracle access is needed (except for the consumption phase that requires access to demand oracles). Together with known algorithmic results, our theorem implies the following polytime approximation results for XOS, submodular and gross substitutes valuations.
Theorem: [Computational results] We devise polytime (in and ) DSIC mechanisms with the following guarantees:

XOS: A approximation, given sample access to the distribution, value and demand oracles, and XOS query oracles.

Submodular: A approximation, given sample access to the distribution, value oracles, and demand oracles. Demand oracles are required only in the consumption phase.

Gross substitutes (GS): A approximation, given only sample access to the distribution and value oracles.
So far we have only considered complementfree valuations. Our second main result concerns valuation functions that exhibit complementarities.
Theorem: [approximation for k] Given a blackbox access to an algorithm for k valuations, a sample access to k distributions , an k query oracle for the valuations in the support of , and a demand oracle for the valuations, there exists a posted price mechanism that, for every k valuation profile , and every , returns an outcome that gives expected social welfare of at least , and runs in time .
By the fact that the class of m valuations (i.e., ) is equivalent to the class of all monotone functions, the last theorem implies the existence of posted prices that gives expected social welfare of at least fraction of OPT. We also show that this bound is tight.
An Illustrating Example.
To give some insight into our results, consider the case of a single item and bidders with values drawn i.i.d. from some distribution . In this setting, the Vickrey auction generates the efficient outcome. How well can one approximate the efficient outcome by setting a single price (that depends only on and ) and allocating to a random bidder
It is known that one cannot hope to achieve better than half of the optimal expected welfare [28]. For instance, suppose is such that each agent has (large) value with probability and value otherwise. Then the probability that any agent has value is , and hence the expected optimal welfare is , which approaches as grows large. On the other hand, no posted price obtains welfare greater than : if , it generates welfare with probability ; whereas if , an arbitrary agent will buy and the expected welfare is . A posted price therefore cannot extract more than half of OPT.
However, there is a simple pricing scheme for a single item that yields half of the optimal social welfare; such methods are known from the prophet inequality literature [30]. Specifically, set price equal to half of the expected highest value. To see why this works, write for the probability that the item is sold, and write for the agent with the highest value for the item (note is a random variable). The expected revenue from the auction is precisely . On the other hand, the probability that nobody buys the item ahead of buyer is at least . The expected surplus (value minus payments) of buyer , conditioned on item being still available, is at least . Putting this together, we have that the expected welfare of the auction, which equals the expected revenue plus the expected buyer surplus, is at least , as claimed.
Our main result shows that the reasoning given in the singleitem example can be extended to markets with multiple heterogeneous items for sale and asymmetric buyers, as long as buyer preferences lie in the class of XOS valuations.
1.4 Related work
Our work is part of the recent body of literature on simple, nonoptimal mechanisms [26, 14]. The design and performance of simple mechanisms is an active field of research, motivated by the observation that in practice, designers are often willing to trade truthfulness or optimality for simplicity. Canonical examples include the generalized second price (GSP) auctions for online advertising [18, 36], and the ascending price auction for electromagnetic spectrum allocation [34].
A particularly relevant example of a simple mechanism is the simultaneous item auction, in which agents make simultaneous, separate bids on multiple items. Such auctions are not truthful, but achieve, at equilibrium, a constant approximation to the optimal welfare when agents have complementfree valuations [6, 13, 21, 27]. A conclusion from this is that by restricting bidders to bid only on individual items, rather than on packages as in the VCG auction, one loses only a constant factor from the optimal welfare. Our results show that it is possible to go one step further, in terms of simplicity. Indeed, posted price mechanisms not only handle items separately but also forego competition entirely and simply publish prices on individual items, and simultaneously exhibit strong incentive compatibility.
There is a long line of research studying the performance of posted price mechanisms under the objective of maximizing revenue. When there is only a single item for sale, posted prices obtain of the optimal revenue in large markets [8]. When agents have unitdemand preferences, a form of postedprice mechanism extracts a constant fraction of the optimal revenue [10, 11, 12]. When there is only a single item for sale, this constant factor persists even when the distributions are unknown, as long as they are MHR [3]. Notably, these works all apply a more relaxed notion of a postedprice mechanism, in which one can set different prices for each customer. In contrast, the mechanisms we consider use nondiscriminatory pricing.
Our work relates to the design of truthful submodular combinatorial auctions. Given access to demand queries, a randomized truthful worstcase approximation exists [15]. It is a major open question whether there is a truthful constantfactor mechanism, using demand queries. It is known that no subpolynomial factor is possible under the value query model [17], or for succinctlydescribed valuations [16]. We show that in Bayesian settings, where the performance of the mechanism is evaluated based on its expected social welfare given an input distribution, one can indeed design a truthful constantfactor submodular combinatorial auction.
Ours is not the first work to turn to the Bayesian setting for combinatorial auction design. Hartline and Lucier [25], Hartline et al. [24] and Bei and Huang [4] provide blackbox reductions that convert an arbitrary welfaremaximization algorithm into an (approximately) Bayesian incentive compatible (BIC) mechanism, without loss of welfare. In particular, one can apply the latter two to constantfactor approximations for submodular CAs to obtain BIC constantfactor mechanisms. However, these mechanisms require time polynomial in the support size of an agent’s valuation distribution, which can be exponential in and . In contrast, our mechanism runs in time polynomial in and , regardless of the valuation distributions’ support sizes. Alaei [2] presents a general method for designing DSIC combinatorial auction mechanisms in Bayesian settings, using an algorithm for a related singleagent optimization problem, but does not consider submodular CAs
2 Preliminaries
Valuation Classes
We study both complementfree valuations, and valuations that exhibit complementarities. There is a standard hierarchy of complementfree valuations (see [31]): additive gross substitutes submodular XOS subadditive.
 additive

for all .
 submodular

for every and , , where .
 XOS

there exists a collection of additive functions such that for every set , .
 subadditive

for any subsets , .
To study valuations with complements, we consider the hierarchy maximum over positive hypergraphs (MPH), introduced recently by [20]. This hierarchy is general enough to encapsulate all monotone valuation functions, and its level captures the degree of complementarity. We defer a formal description to Section 4.
Computational model
An algorithm for the combinatorial auction problem receives as input a valuation profile , and returns an allocation profile. We write for an algorithm, and for the allocation returned. As any explicit description of would have size exponential in , it is usually assumed that there is an oracle access to . We consider the following oracles:

Value oracle takes as input a set , and returns ;

Demand oracle takes as an input a price vector , and returns a set from demand correspondence , breaking ties arbitrarily but consistently;

XOS oracle (only for XOS function ) takes as input a set , and returns the corresponding additive representative function for the set , i.e., an additive function such that (i) for any , and (ii) ;
While value oracle is the least computationally demanding for the buyers and the seller, the demand oracle captures the most basic decision problem a buyer faces in a market with item prices. Since the primary focus of this paper is on the pricing mechanisms, we assume throughout the paper an access to demand and value oracles for granted. We note that XOS oracles are less commonly used in the literature. However, for some classes of valuations XOS oracle can be implemented via polynomially many queries to value oracle, e.g., for any submodular function.
3 Posted Prices for XOS Valuations
The main theorem in this section is the following.
Theorem 3.1.
Let distribution over valuation profiles be given via a sample access to . Suppose that for every we have

blackbox access to a welfare maximization algorithm for combinatorial auctions,

an query oracle (for valuations sampled from ).
Then, for any , we can compute item prices in time such that, for any buyer arrival order, the expected welfare of the posted price mechanism is at least .
Implications.
Before proving Theorem 3.1, let us discuss some implications. First, note that using an approximation algorithm for in Theorem 3.1 results in a posted price mechanism with approximation factor , minus an additive error term that can be made as small as desired. Recall that implementing the consumption phase in a direct revelation mechanism does require access to demand queries; note that Theorem 3.1 and its corollaries below refer specifically to the pricing phase.
If we assume access to demand oracles, then we can use the polytime algorithm of Feige [19] with approximation factor as a black box. Theorem 3.1 then implies the existence of a DSIC mechanism with expected social welfare at least and runtime .
For submodular valuations, one could instead use the algorithm by Vondrak [37] with tight approximation factor that utilizes only value queries. Since queries can be simulated by value queries for submodular valuations [9], we obtain the following corollary:
Corollary 3.2.
Given sample access to submodular distributions and value oracle access to each valuation in the support of , for every , one can compute item prices in time , such that, for any buyer arrival order, the expected welfare of the posted price mechanism is at least .
As before, one can implement the mechanism from Corollary 3.2 as a direct revelation mechanism, if one also has access to demand oracles for the valuations.
For gross substitutes valuations, demand queries can be implemented with a polynomial number of value queries [35], and an optimal allocation can be computed in polynomial time using demand queries [7]. The following corollary follows:
Corollary 3.3.
Given sample access to gross substitutes distributions and value oracle access to each valuation in the support of , for every , one can compute item prices in time , such that, for any buyer arrival order, the expected welfare of the posted price mechanism is at least .
Here, the mechanism from Corollary 3.2 can be implemented as a direct revelation mechanism, using only value queries.
Proof of Theorem 3.1.
We now proceed with the proof of Theorem 3.1. The proof will proceed in two parts. We begin with Lemma 3.4, which establishes the existence of prices that achieve the desired welfare properties, without regard for computation. In fact, Lemma 3.4 will also establish something stronger: if the prices are perturbed slightly, this does not have too large an effect on expected welfare. We will then use this stronger property to show how the prices can be computed efficiently via sampling. This sampling process generates the additional additive error term in Theorem 3.1.
Before delving into the details of the proof, we need the following definition of an item’s welfare contribution. Fix a valuation profile and algorithm , and let be the allocation . For each XOS valuation function , define the corresponding additive representative function for the set as the function satisfying: (i) for any , and (ii) . For every item we define We think of as the contribution of item to the social welfare under valuation profile .
Lemma 3.4.
Given a distribution over valuations, let be the price vector defined as
Let be any price vector such that for all . Then, for any arrival order , consumption under prices results in expected welfare at least .
Proof.
First, by the definition of ,
(1)  
We are now going to estimate the sum of buyers’ utilities in expectation over . Fix and .
Let denote the set of items that have been sold before the arrival of buyer .
Recall that buyer picks an allocation
Consider another random valuation profile which is independent of . Let be the allocation returned by on input . We consider additive representative function for the set , so that for each . Let be the subset of items in that are available to be purchased when buyer arrives. We note that buyer could have picked the set and, therefore, his utility must be at least the utility he would get from purchasing that set. Thus we have
Adding these inequalities for all buyers and taking the expectation over all we get
(2) 
We further observe that does not depend on . That is, . Therefore, we can rewrite (2) as follows:
(3) 
In the second inequality, we decreased each probability to ; the inequality holds as all the terms in the summation are non negative. In the third inequality we decreased the random variables under expectations and substituted every variable to . The last equality follows from (1). Inequality (3) is our desired bound on the sum of buyer utilities.
We now turn to the expected revenue, which is
(4) 
Proof Sketch.
(of Theorem 3.1) It remains to show how to compute an appropriate choice of prices satisfying the conditions of Lemma 3.4. Our approach will be to estimate by repeatedly sampling a valuation profile and computing . Since is a random variable lying in , standard concentration bounds imply that we can accurately estimate its expectation in a relatively small number of samples. In Appendix A we work out the appropriate bounds and show that samples per item are sufficient to satisfy the conditions of Theorem 3.1.
We can therefore take to be the empirical estimate after this number of samples, satisfying the conditions of the theorem. To summarize, this procedure for computing is listed formally as Algorithm 1. ∎
4 Posted Prices for General Valuations
A result similar to Theorem 3.1 holds for the more general class of  valuations, where we get approximate DSIC mechanisms for functions with complementarity level . We will begin by formally defining the maximum over positive hypergraphs () hierarchy and providing other preliminaries. We will then provide a formal result statement.
4.1 Preliminaries and Definitions.
To explain maximum over positive hypergraphs () hierarchy, we first need a few preliminaries. A hypergraph representation of valuation function is a set function that satisfies . It is easy to verify that any valuation function admits a unique hypergraph representation and vice versa. A set such that is said to be a hyperedge of . The hypergraph representation can be thought as a weighted hypergraph, where every vertex is associated with an item in , and the weight of each hyperedge is . Then the value of the function for any set is the total value of all hyperedges that are contained in .
The rank of a hypergraph representation is the cardinality of the largest hyperedge. The rank of is the rank of its corresponding and we refer to a valuation function with rank as a hypergraph valuation. If the hypergraph representation of is nonnegative, i.e. for any , , then we refer to function as a positive hypergraph function (PH) [1]. We are now ready to present the class of  valuations.
Definition 4.1 ( valuation).
A monotone valuation function is Maximum over Positive Hypergraph () if it can be expressed as a maximum over a set of PH functions. That is, there exist PH functions such that for every set ,
(5) 
where is an arbitrary index set.
It can be easily verified that the highest level of the hierarchy,  captures all monotone functions, and the lowest level, , captures all functions.
Finally, we define what is meant by an MPH oracle, which is an extension of XOS oracles to higher levels of the hierarchy. Suppose that valuation function is MPH , with supporting PH functions . An MPH oracle for takes as input a set of items , and returns the PH function for which . We will assume that this function is returned in its explicit hypergraph representation, i.e. as a list of weighted hyperedges. Note that the size of this representation depends on the number of hyperedges required to express the PH functions , and is at most . On a side note, it is this bound that leads to a runtime that is polynomial in in Theorem 4.1. Note that if we restricted attention to MPH valuations whose supporting PH functions each have at most hyperedges, then this runtime dependency would change from to .
4.2 Pricing for  valuations.
Our result is cast in the following theorem, whose proof is deferred to Appendix B.
Theorem 4.1.
Suppose our Bayesian instance over valuations is given via a sample access to . Suppose that for every we have

blackbox access to a welfare maximization algorithm for combinatorial auctions,

an query oracle for the valuations in the support of .
Then, for every , one can compute item prices in time
We also show that this result is essentially tight. Indeed, for each level of complementarities across the items in the  hierarchy, we may consider single minded (of size ) and unitdemand valuations. It turns out that item prices may result in an outcome with a linear (in the number of items) loss in social welfare. The example is deferred to Appendix C.
5 Discussion and Open Problems
We conclude with a few remarks.
First, in our mechanisms, we consider an arbitrary order of arrivals, which may be chosen by an adversary after the prices are posted, but before the adversary observes the realization of the buyer valuations. It is not difficult to verify that the same results extend to an adaptive adversary, who chooses the arrival order sequentially; i.e., an adversary who observes which items have been purchased by previous buyers and even the realization of previous buyers’ valuations, and chooses the next buyer to arrive based on this information. Our proof techniques (in Theorems 3.1 and 4.1) apply to this adaptive adversary as well.
Second, readers who are familiar with literature on Walrasian equilibrium will realize the similarities between the two models, but also the stark contrast. The main difference is whether agents arrive to the market sequentially (as in our model), or simultaneously (as in a Walrasian equilibrium). Recent results [22] have shown that in the simultaneous model (even when some items may remain unsold), there may be a linear loss in welfare for XOS buyers, even in a full information setting. Thus our work demonstrates a strong gap in welfare between simultaneous and sequential arrivals, when restricted to individual demand satisfaction.
Our model and results leave a number of directions for future research. First, the constant approximation for XOS valuations implies (by known results, see e.g. [5]) a logarithmic approximation for subadditive valuations. It remains open whether a constant approximation for subadditive valuations can be achieved.
In this work we focused on a setting in which the buyer arrival order is adversarial, but one might consider relaxing this worstcase setting. For example: does the approximability of the problem substantially improve if the buyers arrive in a uniformly random order? What if the mechanism can select the order, subject to incentive compatibility constraints? Alternatively, one might ask whether a constant approximation is still possible if the adversary is more powerful, and can observe all valuation realizations before selecting the arrival order. Also, rather than looking at an exogenouslyimposed arrival order, one might imagine bidders strategically choosing their arrival times, with early positions in queue being costly to secure.
Finally, throughout the paper we assume that items are indivisible and heterogeneous. It would be interesting to partially relax these assumptions. For example, one could assume that every item in the market has a few identical copies and that every buyer wants at most a single copy of each item. It would be interesting to analyze the efficiency of posted price mechanisms as a function of the minimal number of item copies. Given the negative results for valuations with high degree of complementarity, it would be particularly interesting to find relaxations that admit positive results, say for singleminded buyers.
Acknowledgments
We are grateful to Shaddin Dughmi, David Kempe and Noam Nisan for helpful discussions. Michal Feldman is partially supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/20072013) / ERC grant agreement number 337122.
Appendix
Appendix A Details of the proof of Theorem 3.1
We now present the details omitted from the proof of Theorem 3.1.
We wish to show how to compute an appropriate choice of prices satisfying the conditions of Lemma 3.4. Our approach will be to estimate by repeatedly sampling a valuation profile and computing . Since is a random variable lying in , standard concentration bounds imply that we can accurately estimate its expectation in a relatively small number of samples. We can therefore take to be the empirical estimate after this number of samples, satisfying the conditions of the theorem. This procedure is listed formally as Algorithm 1 in Section 3.
We wish to choose large enough that, with probability at least , we will have for all . Fix any and note that is the average of identical samples from a distribution supported on , with expected value . Thus, by the Hoeffding bound, we have that
We can therefore choose to get . Applying a union bound over all , we have that for all with probability at least , as desired.
Setting in Lemma 3.4, we have that our computed prices generate welfare at least , with probability at least . We conclude that our computed prices generate an expected welfare of at least
as required. The last inequality follows since .
Appendix B Proof of Theorem 4.1: valuations
We closely follow the proof of Theorem 3.1 for XOS buyers. However, there is an extra difficulty for  valuations, since the concept of the “contribution of an item to welfare” is not as straightforward as for valuations. Our main new challenge will be to appropriately account for the contributions of different items.
We first describe an ideal price vector which we would like to use for the distribution . For each fixed valuation profile we consider allocation returned by blackbox algorithm . For each MPH valuation function we take the respective hypergraph representative function for the set , i.e., for any and . Write for the hypergraph weights corresponding to the hypergraph function ; then, by definition, for all .
For every , every buyer , and each item , we define
where is a constant to be determined later. The price vector has a natural interpretation: for each hyperedge in the hypergraph function , divide its weight uniformly among the items in that edge; the price of item is then the total weight allocated to item , scaled down by factor . The price for item is the ideal price we would like to set in the fullinformation setting, if we knew the valuation profile .
We can now define an ideal price of item in the Bayesian setting, which will be
The following Lemma relates the fullinformation prices for a subset of items to the marginal impact on a buyer’s value if those items are removed from an allocation.
Lemma B.1.
For any , any buyer , and any ,
Proof.
where the first inequality follows because only for with , and the second inequality follows by noting that each hyperedge counted in the second summation must have a nonempty intersection with and is counted times. ∎
The next Lemma estimates the expected social welfare of a mechanism with posted prices that are close to the ideal .
Lemma B.2.
Let be such that for all . Then consumption under prices results in expected welfare of at least .
Proof.
Given the prices , let be the (adversarial) order of arrival. We are going to bound the sum of buyers’ utilities in expectation over . To do so, for each fixed and , we consider another random valuation profile , drawn independently of . Consider also , the allocation returned by on the valuation profile . Let be the subset of items in that are already sold when buyer is selected to make a purchase. Let be the subset of items in that remain unsold at this time. We note that buyer could have picked the set and, therefore, his utility is at least the utility he would get from this set. Thus we have
Applying Lemma B.1 to valuation profile and set , we conclude
We now sum over all and take an expectation over to conclude that
(6) 
Let us analyze separately the two summations on the RHS of (B). For the first summation, note that does not appear in the expression within the expectation. Thus, by applying a change of variables and then using linearity of expectation, we have
(7) 
Note that the inequality follows from the fact that for each item .
For the second summation on the RHS of (B), we first recall that sets and are defined for the prices . Further note that since and are drawn independently, we have
(8) 
The first inequality follows because the probability that is sold before agent arrives is dominated by the probability that is sold at all, and the second inequality follows from the fact that for each item .
(9) 
As long as , we can rearrange and conclude
Taking , we conclude that the expected welfare of the Posted Pricing Mechanism is within a factor of the expected welfare of and small additive error of , as required. ∎
We continue with the proof of Theorem 4.1. Following the same analysis as in Theorem 3.1 for each item we can estimate the price by sampling valuation profiles, so that . We compute for each sample (using algorithm and the MPH query oracle) and take the average of all prices seen. Applying a union bound over all we obtain a guarantee that for all with probability at least . Now, by setting in Lemma B.2 we have our computed prices to generate welfare of at least with probability at least .
Finally, we conclude that generated expected welfare is at least
as required. The last inequality follows, since .
Appendix C Lower bound for
Example.
Suppose there are identical items in the market and two buyers. Let the first buyer have unitdemand valuation per item and the second singleminded buyer have value for the set of all items and value for any smaller subset. The optimal social welfare OPT is , where the second buyer is allocated all items.
Let the seller fix prices on the items. We let the first buyer arrive first. He will buy the cheapest item, if its price is below . Then the second buyer has value for the remaining items, which results in a social welfare of . In the case where each item costs at least , the first buyer purchases nothing but so does the second buyer, as he derives value from the entire set, for a total cost of at least . Therefore, the social welfare in the latter case is . We conclude that the social welfare does not exceed in either of the cases, which gives us the claimed linear gap of with respect to the optimal social welfare.
Footnotes
 For some models of valuation access, such as the value query model, it is in fact known that no subpolynomial worstcase approximation is possible [17].
 All of our results hold under arbitrary arrival orders, so one can also think of an adversary as choosing the order.
 While answering a demand query might be NPhard in some cases, in the context of combinatorial auctions it is natural to expect the agent to be able to answer a demand query. Otherwise it would be unreasonable to expect any mechanism to satisfy the agents’ demands. Furthermore, in some cases there are polytime algorithms for answering demand queries. For example, for gross substitutes valuations demand queries can be implemented with a polynomial number of value queries [35].
 Since agents are iid, this is equivalent to an adversarial order that doesn’t depend on the value realizations.
 While Alaei [2] does not explicitly discuss submodular CAs, our understanding is that one could use his methodology together with an algorithm for (singleagent) submodular function maximization to construct a constantfactor DSIC mechanism for the submodular CA problem. We note that such a mechanism would not fall within the postedprice paradigm.
 Note that if a buyer has more than one bundle in his demand correspondence, then we assume that ties can be broken arbitrarily – even adversarially.
 The proof of Theorem 4.1 follows Theorem 3.1, but with an important difference: the accounting of the contribution of an item to the welfare is more complex, since one must consider all hyperedges in which appears. This complicates the choice of prices, as well as the derivation of welfare bounds.
 The exponential dependence on in the runtime is related to the representation of valuations. In particular, the output of an  oracle can be of size . One could reduce this bound by imposing constraints on the complexity of a valuation’s representation. This is discussed further in Appendix B.
References
 Ittai Abraham, Moshe Babaioff, Shaddin Dughmi, and Tim Roughgarden. Combinatorial auctions with restricted complements. In ACM Conference on Electronic Commerce, pages 3–16, 2012.
 Saeed Alaei. Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers. In FOCS, pages 512–521, 2011.
 Moshe Babaioff, Liad Blumrosen, Shaddin Dughmi, and Yaron Singer. Posting prices with unknown distributions. In ICS, pages 166–178, 2011.
 X. Bei and Z. Huang. Bayesian incentive compatibility via fractional assignments. In SODA, 2011.
 Kshipra Bhawalkar and Tim Roughgarden. Welfare guarantees for combinatorial auctions with item bidding. In SODA, pages 700–709, 2011.
 Kshipra Bhawalkar and Tim Roughgarden. Simultaneous singleitem auctions. In WINE, 2012.
 L. Blumrosen and N. Nisan. Combinatorial auctions. In N. Nisan, T. Roughgarden, É. Tardos, and V. Vazirani, editors, Algorithmic Game Theory, chapter 11, pages 267–299. Cambridge University Press, 2007.
 Liad Blumrosen and Thomas Holenstein. Posted prices vs. negotiations: an asymptotic analysis. In EC, page 49, 2008.
 Liad Blumrosen and Noam Nisan. On the computational power of demand queries. SIAM J. Comput., 39(4):1372–1391, 2009.
 Shuchi Chawla, Jason D. Hartline, and Robert D. Kleinberg. Algorithmic pricing via virtual valuations. In ACM Conference on Electronic Commerce, pages 243–251, 2007.
 Shuchi Chawla, Jason D. Hartline, David L. Malec, and Balasubramanian Sivan. Multiparameter mechanism design and sequential posted pricing. In STOC, pages 311–320, 2010.
 Shuchi Chawla, David L. Malec, and Balasubramanian Sivan. The Power of Randomness in Bayesian Optimal Mechanism Design. In the 11th ACM Conference on Electronic Commerce (EC), 2010.
 George Christodoulou, Annamária Kovács, and Michael Schapira. Bayesian combinatorial auctions. In ICALP, pages 820–832, 2008.
 Peerapong Dhangwatnotai, Tim Roughgarden, and Qiqi Yan. Revenue maximization with a single sample. In EC, pages 129–138, 2010.
 Shahar Dobzinski. Two randomized mechanisms for combinatorial auctions. In APPROXRANDOM, pages 89–103, 2007.
 Shahar Dobzinski and Jan Vondrák. The computational complexity of truthfulness in combinatorial auctions. In EC, pages 405–422, 2012.
 Shaddin Dughmi and Jan Vondrák. Limitations of randomized mechanisms for combinatorial auctions. In FOCS, pages 502–511, 2011.
 Benjamin Edelman, Michael Ostrovsky, and Michael Schwarz. Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. Technical report, National Bureau of Economic Research, 2005.
 Uriel Feige. On maximizing welfare when utility functions are subadditive. SIAM J. Comput., 39(1):122–142, 2009.
 Uriel Feige, Michal Feldman, Nicole Immorlica, Rani Izsak, Brendan Lucier, and Vasilis Syrgkanis. A unified approach to valuations with restricted complements. In Working paper, 2014.
 Michal Feldman, Hu Fu, Nick Gravin, and Brendan Lucier. Simultaneous auctions are (almost) efficient. In STOC, pages 201–210, 2013.
 Michal Feldman, Nick Gravin, and Brendan Lucier. Combinatorial walrasian equilibrium. In STOC, pages 61–70, 2013.
 Faruk Gul and Ennio Stacchetti. Walrasian equilibrium with gross substitutes. J. of Economic Theory, 87(1):95–124, 1999.
 Jason D. Hartline, Robert Kleinberg, and Azarakhsh Malekian. Bayesian incentive compatibility via matchings. In SODA, pages 734–747, 2011.
 Jason D. Hartline and Brendan Lucier. Bayesian algorithmic mechanism design. In STOC, 2010.
 Jason D. Hartline and Tim Roughgarden. Simple versus optimal mechanisms. In EC, pages 225–234, 2009.
 Avinatan Hassidim, Haim Kaplan, Yishay Mansour, and Noam Nisan. Nonprice equilibria in markets of discrete goods. In EC, pages 295–296, 2011.
 Theodore P. Hill and Robert P. Kertz. A survey of prophet inequalities in optimal stopping theory. CONTEMPORARY MATHEMATICS, 125, 1992.
 Jr Kelso, Alexander S and Vincent P Crawford. Job matching, coalition formation, and gross substitutes. Econometrica, 50(6):1483–1504, November 1982.
 Robert Kleinberg and S. Matthew Weinberg. Matroid prophet inequalities. In Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19  22, 2012, pages 123–136, 2012.
 Benny Lehmann, Daniel Lehmann, and Noam Nisan. Combinatorial auctions with decreasing marginal utilities. Games and Economic Behavior, 55(2):270 – 296, 2006. Mini Special Issue: Electronic Market Design¡/ce:title¿.
 Azevedo Eduardo M., Glen E. Weyl, and White Alexander. Walrasian equilibrium in large, quasilinear markets. Theoretical Economics, 8:281–290, 2013.
 Paul Milgrom. Auctions and Bidding: A Primer. Journal of Economic Perspectives, 3(3):3–22, 1989.
 Paul Milgrom. Game theory and the spectrum auctions. European Economic Review, 42(3):771–778, 1998.
 Renato Paes Leme. Gross substitutability: An algorithmic survey. 2013.
 Hal R. Varian. Search engine economics. In Wirtschaftsinformatik (1), pages 29–30, 2007.
 Jan Vondrák. Optimal approximation for the submodular welfare problem in the value oracle model. In STOC, pages 67–74, 2008.