Advertising has emerged as the primary method of monetization for online services, search engines, social media platforms, etc. Large platforms implement their own auction markets to control ad placement and pricing. Abstractly, an auction market is a set of rules that governs the allocation of impressions—opportunities to show ads to online users—to bidders—advertisers who pay the platform to show impressions. Typically, bidders specify a target set of users, as well as the price they are willing to pay for each impression. They also set a budget that limits their total expenditure within a given time interval, say during a single day. Given advertisers’ targeting criteria, bids, and budgets, the role of the platform is to allocate impressions and set prices that respect bidders’ bids and budgets.
A simple implementation consists in running an independent auction for each impression, removing a bidder from the set of participants once her budget runs out. However, this as-soon-as-possible approach has several downsides. A bidder who makes large bids but has a small budget will quickly expend it on the first impressions that become available. From the perspective of maximizing overall utility in the system—i.e., social welfare—this is suboptimal because the bidder will likely win generic impressions of interest to many other bidders instead of winning specific impressions that the bidder uniquely values. Similarly, this is suboptimal for the bidder because the increased competition on generic impressions will induce higher prices, leading to lower utility than if the bidder had bought specific impressions.
There are two broad approaches to taking budgets into consideration: bidder selection and bid modification. The goal in bidder selection is to choose a subset of participants for each auction, from the set of bidders whose budgets have not been exhausted, in a way that optimizes the use of bidders’ overall budgets. This has been considered in both first and second price settings. In the context of first price auctions, the celebrated work of Mehta et al. (2007) gives an algorithm for online allocation of impressions to bidders to maximize overall ad revenue. Their allocation algorithm, and those in the large body of follow-up work (see the survey by Mehta (2013)), can be interpreted as running a first price auction for each impression after removing a subset of bidders from the auction based on their remaining budgets. Bidder selection has also been explored in the context of Generalized Second Price (GSP) auctions, particularly for multi-objective optimization in search engines (Abrams et al., 2008; Azar et al., 2009; Goel et al., 2010; Karande, Mehta, and Srikant, 2013). An important feature of bidder selection is that a bidder who is chosen to participate in the auction does so with her original bid, i.e., the platform does not modify bid values of participating bidders.
This paper focuses on bid modification, wherein the platform shades an advertiser’s bids in order to preserve her budget for the future. This is commonly implemented by scaling an advertiser’s bid by a pacing multiplier (of value ). Many ad platforms provide a free option to advertisers to automatically have their bids scaled, and an impressive body of work has focused on advertiser strategies for bid modification in order to maximize their ROI (Rusmevichientong and Williamson, 2006; Borgs et al., 2007; Cary et al., 2007; Feldman et al., 2007; Hosanagar and Cherepanov, 2008). Recent work has studied pacing equilibria in the context of second-price auctions: Balseiro et al. (2017) study several budget smoothing methods including multiplicative pacing in a stochastic context where ties do not occur; Balseiro and Gur (2017) study how an individual bidder might adapt their pacing multiplier over time in a stochastic continuous setting; Conitzer et al. (2018) study second price pacing when bidders, goods, budgets, and valuations are known, and prove that equilibria exist under fractional allocations. In this paper, we study pacing in the context of first price auctions. While second price auctions displaced first price auctions in Internet advertising because of their many desirable robustness guarantees, particularly related to stability (Edelman and Ostrovsky, 2007) and strategyproofness, first price auctions are regaining popularity because they are simple to operate and offer a degree of transparency and ease of use that second price auctions do not (Chen, 2017; Sluis, 2017). In the context of position auctions, Dütting, Fischer, and Parkes (2018) further showed that first price does not suffer from the same equilibrium selection problems that GSP and VCG does. Moreover, as we will see later, first price auctions provide a clean characterization of equilibrium solutions in the context of pacing, unlike in the case of second price auctions (Conitzer et al., 2018). Indeed, as stated earlier, perhaps the most robust literature in ad auctions relates to bidder selection in first price auctions (Mehta, 2013). Our work complements this line of work by focusing on bid modification instead of bidder selection as the preferred method for budget management.111In Mehta et al. (2007) and most other related papers, bidder selection is performed by using a “scaling parameter” for bids based on remaining budgets, but once the winner of an auction is selected, she pays her entire (unscaled) bid for the impression. In contrast, in our work, the individual bids are scaled using the respective pacing multipliers, and the winner pays the scaled bid instead of her original bid for the impression. Another point of difference is that the scaling multiplier changes from one impression to the next in the budgeted allocation literature since it is only a tool for winner selection, whereas we choose a single pacing multiplier for a bidder that is used to scale her bids for all the impressions in the problem instance.
We are given a set of bidders, goods, valuations, and budgets. A first price auction is conducted for each individual good. All bidders participate in every auction, but we are allowed to choose per-bidder pacing multipliers which scale their bids. A set of pacing multipliers is said to be budget feasible (abbreviated bfpm) if no bidder’s total payments exceeds her budget. We say that a set of bfpm is maximal if they dominate any other bfpm. Furthermore, we say that a set of bfpm yields a pacing equilibrium if the pacing multipliers are simultaneously optimal for all bidders in the following sense: every bidder either spends her entire budget or her pacing multiplier is set to 1. We will allow goods to be allocated fractionally if there are ties; this is well-motivated in e.g. the ad-auction setting, where goods may thousands of impressions. Note that pacing equilibria can be defined in both first and second price settings – we abbreviate these respectively by fppe and sppe. The goal of this paper is to characterize fppe, study their properties, and design algorithms to find them.
Existence and Uniqueness. A priori, it is not clear if an fppe always exists. Our first result shows that not only does an fppe always exist, but also that it is essentially unique.222More precisely, pacing multipliers are unique but there may be different equivalent allocations due to tie breaking. This does not impact revenue, social welfare or individual utilities. In fact, we show that the fppe exactly coincides with the (unique) maximal set of pacing multipliers. This also leads to the observation that the fppe is revenue-maximizing among all bfpm. Furthermore, we also show that the fppe yields a competitive equilibrium, i.e., every bidder is exactly allocated her demand set. It is worth noting the contrast with sppe, which are not unique in general (Conitzer et al., 2018).
Computability. We show an interesting connection between fppe and a generalization of the classical Eisenberg-Gale (eg) convex program for quasi-linear utilities (Cole et al., 2017). Using Fenchel duality, we use the eg program to infer that the unique maximal bfpm, which is also revenue maximizing, yields the unique fppe. Moreover, this connection with the eg program immediately yields a (weakly) polynomial algorithm to compute the fppe. This also contrasts with sppe, for which maximizing revenue (or other objectives like social welfare) is known to be NP-hard (Conitzer et al., 2018). Indeed, no polynomial-time algorithm is known for even finding an arbitrary pacing equilibrium in the second price setting.
Monotonicity and Sensitivity: We show that fppe satisfies many notions of monotonicity, both in terms of revenue and social welfare. Adding an additional good weakly increases both revenue and social welfare, and adding a bidder or increasing a bidder’s budget weakly increases revenue. Note that this also distinguishes fppe from sppe, which generally do not satisfy such monotonicity conditions.
In fact, not only is the revenue obtained in an fppe monotonically non-decreasing with increasing budgets, but it also changes smoothly in the sense that increasing the budget by some can only increase the revenue by . Again, this does not hold in sppe where the revenue can increase by a substantial amount even for a small change in the budgets.
Shill-proofness: Using monotonicity, we also establish that there is no incentive for the provider to enter fake bids (shill-proof), unlike in sppe.
Simulations: Using our convex program we perform simulations on synthetic data. We find that the ex-post regret associated with fppe gets low quickly as markets get thick, especially when bidders can only change the scale of their utilities, as is usually the case in ad markets when bidding on conversions (e.g. clicks). We furthermore show that even with just a bit of market thickness bidders have no incentive to misreport budgets in order to shift the fppe outcome. Finally, we compare fppe and sppe revenue and social welfare across instances. We find that fppe always has better revenue, while welfare splits evenly on which solution concept performs better.
First-price Pacing Equilibria
We consider a single-slot auction market in which a set of bidders target a set of (divisible) goods . Each bidder has a valuation for each good , and a budget to be spent across all goods. We assume that the goods are sold through independent (single slot) first-price auctions, and the valuations and budgets are assumed to be known to the auctioneer. When multiple bids are tied for an item we assume that the item can be fractionally allocated, and we allow the auctioneer to choose the fractional allocation (though our later results on equivalence to competitive equilibrium show that the fractional choices are optimal for the bidders as well).
The goal is to compute a vector ofpacing multipliers that smooths out the spending of each bidder so that they stay within budget. A pacing multiplier for a bidder is a real number that is used to scale down the bids across all auctions: for any , bidder participates in the auction for good with a bid equal to ; we refer to these bids as multiplicatively paced. We define feasibility as follows:
A set of budget-feasible first-price pacing multipliers (bfpm) is a tuple , of pacing multipliers for each bidder , and factional allocation for bidder and good with the following properties:
(Prices) Unit price for goods .
(Goods go to highest bidders) If , then for each bidder and good .
(Budget-feasible) for bidders .
(Demanded goods sold completely) If , then for each good .
(No overselling) for each good .
Within the feasible space, we’re particularly interested in outcomes that are stable in some sense. Specifically, solutions where no bidder is unnecessarily paced, which we call first-price pacing equilibria (fppe).
A first-price pacing equilibrium (fppe) is a bfpm tuple , of pacing multipliers for each bidder , and factional allocation for bidder and good with these additional properties:
(No unnecessary pacing) If , then for each bidder .
Existence, uniqueness, and structure of fppe
A priori it’s not obvious whether there are bfpm that satisfy the additional constraint of no unnecessary pacing. We show that not only are fppe guaranteed to exist, they are also unique and maximize the seller’s revenue over all bfpm. In the following, the inequality symbols are component-wise.
There exists a Pareto-dominant bfpm (i.e., component-wise for any other bfpm ).
First, we will show that given any two bfpm and , there exists a bfpm with pacing multipliers that are the component-wise maximum of and . Note that, on each item, the resulting paced bid for a bidder is the higher of her two paced bids on this item in the original two bfpms. Let the corresponding allocation be: for each good , identify which of the two bfpms had the highest paced bid for , breaking ties towards the first bfpm; then, allocate the good to the same bidder as in that bfpm (if the good was split between multiple bidders, allocate it in the same proportions), at the same price. Note that these prices coincide with the winning bidders’ paced bids in the new solution. Thus, we charge the correct prices, goods go to the highest bidders, demanded goods are sold completely, and there is no overselling.
All that remains to be verified is that the new solution is budget-feasible. Consider bidder in the bidder-wise-max . In either or , bidder had the exact same multiplier—say it was in for (breaking ties towards ); the others’ multipliers in were the same or lower compared to . Thus, if did not have the highest bid on an item in , then also does not win this item under . If did have the highest bid on an item in , then in , at most can win the same fraction of the item as in , at the same price. This is because of the following reasons. If is winning a nonzero fraction of in , then either the highest bid on under was strictly higher than that under the other bfpm, in which case the same allocation as in is used; or, the highest bid on was the same in both of the original bfpms and the tie was broken towards the allocation of in , which implies that and therefore . (It cannot be the case that the highest bid on under was strictly lower than that under the other bfpm, because in that case bidder ’s bid would not be the highest under .) It follows that spends no more than under bfpm , which is budget-feasible. Hence, the new bfpm is budget-feasible.
We now complete the proof. Let . We will show that is part of a bfpm, proving the result. For any and any , there exists a bfpm where . By repeatedly taking the component-wise maximum for different pairs of , we conclude there is a single bfpm such that for every , . Because the space of combinations of multipliers and allocations is compact, the sequence (as ) has a limit point . This limit point satisfies all the properties of a bfpm by continuity. ∎
In addition to there being a maximal set of pacing multipliers over all bfpm, this maximal bfpm is actually an fppe.
Lemma 2 (Guaranteed existence of fppe).
The Pareto-dominant bfpm with maximal pacing multipliers has no unnecessarily paced bidders, so it forms a fppe.
We prove the statement by contradiction. If bidder is paced unnecessarily under maximal bfpm , either it tied with another bidder on some good or not. If it’s not tied for any good, then we can increase bidder ’s pacing multiplier by a sufficiently small such that is still not tied for any item and still within budget, contradicting the fact that was maximal. So bidder must be tied for at least some good. Define as all the bidders that are tied for any good with bidder , i.e. . Now take the transitive closure , i.e., include all bidders who are tied for an item with a bidder in , etc. Once one has the transitive closure, redistribute the items that are tied such that none of the bidders in are budget constrained (while still allocating items completely). Simultaneously increase the pacing multipliers of all bidders in by so that all bidders in are still not budget-constrained, and no new ties are created; call this set of pacing multipliers and the redistributed goods . This contradicts that was the maximal bfpm to begin with, as is a bfpm yet it has pacing multipliers that are higher than in . ∎
The converse of Lemma 2 is also true: any bfpm for which at least one bidder has a pacing multiplier lower than the maximal bfpm must have an unnecessarily paced bidder.
Consider two bfpm and , where and for some bidder . Then, must have an unnecessarily paced bidder.
Consider the set of all bidders whose pacing multipliers are strictly lower in than in (by definition there must be at least one bidder in this set). Collectively, wins fewer (or the same) items under than under (the bids from outside have stayed the same, those from have gone down), and at lower prices. Since was budget feasible, was not breaking its collective budget before. Since is spending strictly less, at least some bidder must not spend their entire budget and thus is unnecessarily paced. ∎
This implies that the pacing multipliers of fppe are uniquely determined.
Corollary 1 (Essential Uniqueness).
The pacing multipliers of any fppe are uniquely determined and correspond to the pacing multipliers of the maximal bfpm.
While the pacing multipliers are uniquely determined, the allocation is not: Tie-breaking may give different goods to different bidders. However, the tie-breaking is inconsequential in the sense that the bidder utilities (and thus social welfare), item prices (and thus revenue), and which set of bidders are budget constrained, are all uniquely determined.
Given two bfpm, if the pacing multipliers of one dominate the other, then the revenue of that bfpm must also be at least as high. In the following, let refer to the revenue of a bfpm .
Given two bfpm and , where , .
Since , prices under must be at least as large as under . By the definition of bfpm, all demanded items must be sold completely. Therefore, under we sell at least all the items as we did under at prices that are at least those under , hence the . ∎
Corollary 2 (Revenue-maximizing).
The fppe is revenue-maximizing among all BFPM.
Given input , an fppe is guaranteed to exist. In addition, the uniquely-determined maximal pacing multipliers maximize the revenue over all bfpm.
Properties of First-Price Pacing Equilibria
We first show that an fppe is also a competitive equilibrium. In fact, we show that the concept of fppe is equivalent to a natural refinement of competitive equilibrium.
A competitive equilibrium consists of prices of goods and feasible allocations of goods to bidders such that the following properties hold:
Each bidder maximizes her utility under the given prices, that is, for every it holds that .
Every item with a positive price is sold completely, that is, for all , .
We now introduce a refinement of competitive equilibrium that requires that each individual dollar that a bidder has is spent (or not spent) in a way that maximizes the utility obtained by the bidder for that dollar. Thus, there exists a rate for each bidder that indicates her return on a dollar.
An equal-rates competitive equilibrium (erce) is a competitive equilibrium such that for every bidder , there is a number such that:
If , then .
If does not spend her entire budget, then .
We obtain the following characterization of fppe.
A combination of prices and allocations is an erce if and only if it is an fppe.
We first note that budget feasibility, the no-overselling condition, and the condition that items with a positive price must be sold completely, appear in the definitions of both concepts, so we only need to check the other conditions.
We first prove that an fppe is also an erce. Let . First, consider a bidder with . If for some , then , proving both conditions in the definition of an erce. Moreover, for any item , we have . Therefore, the bidder is spending optimally given the prices.
Next, consider a bidder with . If for some , then , proving the first condition in the definition of an erce. Moreover, by the definition of fppe, such a bidder must spend her entire budget, proving the second condition. Moreover, for any item , we have . Hence, the bidder is spending all her budget on the optimal items for her, and leaving money unspent would be suboptimal because . Therefore, the bidder is spending optimally given the prices. We conclude that an fppe is also an erce.
We next prove that an erce is also an fppe. For a bidder with , consider the set of items . By the erce property, we have that for , . Let . We must have , because otherwise ’s dollars would be better left unspent, contradicting the first property of competitive equilibrium. Also, if then all of ’s budget must be spent, establishing that no bidder is unnecessarily paced. For a bidder with , define .
Now, we show that no part of an item can be won by a bidder for whom is not maximal; if it were, by the first erce condition we would have and another bidder for whom . Hence, , but this would contradict that is receiving an optimal allocation under the prices.
Next, we prove that the prices are set correctly for an fppe. For any item , if it is sold completely, consider a bidder with . Again, by the first erce condition we have , and we have already established that this bidder must maximize . If the item is not entirely sold, then by the second condition of competitive equilibrium it must have price . This in turn implies that all bidders have value for it, for otherwise there would be a bidder with , who hence should be able to obtain a utility of since every one of the bidder’s dollars must result in that amount of utility for her—but this is clearly impossible with finitely many resources. Thus, we have established all the conditions of an fppe. ∎
Next, we show that, unlike with second-price payments, under fppe the seller does not benefit from adding fake bids.
A solution concept is shill-proof if the seller does not benefit from adding fake bids.
fppe are shill-proof.
Note that if we start from an fppe and remove both a bidder and the items it wins, we still have an fppe, since the remaining bidders are spending the same as before, and the remaining items are allocated as before and thus fully allocated. Consider an instance of a market with three fppe: (a) an fppe with shill bids, (b) an fppe of the market without shill bids, and (c) the fppe generated by removing both the shill bids and the items they won from (a). Notice that the seller makes the same revenue in (a) and (c). Moreover, by Proposition 3 we know that the revenue of (b) is weakly greater than the revenue of (c), and therefore it is weakly greater than the revenue of (a). Thus, the seller cannot benefit from shill bids. ∎
Akbarpour and Li (2018) observe that a first-price single-item auction is also credible, in the sense that the seller/auctioneer cannot benefit from lying about what other agents have done in the mechanism. However, fppe do not satisfy this property.
Suppose and . The fppe sets and allocates both items to bidder . But the auctioneer could lie to bidder claiming that someone else had bid for item , and charge bidder a price of for item ; and meanwhile charge bidder a price of for item , for a higher revenue overall.
An fppe does have a price predictability guarantee: given any allocation, a bidder either pays its full value or pays its budget. Even though individual item prices may not be known, this guarantees a degree of transparency to bidders about the price they will pay.
An fppe is also robust to deviations by groups of bidders:
An allocation with a set of payments is in the core if no group of bidders has an incentive to form a coaltion with the seller to attain an outcome that is strictly better for all agents in the coalition.
An fppe is in the core.
Since an fppe is a competitive equilibrium, if we treat money as a good then we have a traditional locally non-satiated Walrasian equilibrium in an exchange economy. Since a locally non-satiated Walrasian Equilibrium is in the core, an fppe is also in the core. ∎
Monotonicity and Sensitivity Analysis
We showed that fppes are guaranteed to exist, that they are unique (up to inconsequential tiebreaking), and that they satisfy a number of attractive properties. We now look at how well-behaved fppe is under changing conditions. We would ideally like the solution concept to be stable, so that changes in input cannot lead to disproportionate changes in output. We will show that this is largely the case. This is in contrast to sppe, where Conitzer et al. (2018) showed that the equilibrium can be very sensitive: firstly, sppe is not unique, and the revenue and welfare can change drastically across equilibria. Secondly, even when there is a unique equilibrium, small budget changes may lead to large revenue changes.
We investigate whether fppe is monotonic when adding bidders or goods, or when increasing budgets or valuations. Table 1 summarizes our results.
Revenue monotonicity is maintained for adding bidders, goods, and budget, but not incremental additions to valuations. Our proofs of revenue monotonicity all rely on Corollary 2: the fact that multipliers in an fppe are maximal among bfpms. Bidder and budget monotonicity both follow from a particularly simple argument: the original solution remains a bfpm, and thus by maximality of fppe over bfpms monotonicity is maintained. Explicit proofs and statements are given in the appendix. We show revenue monotonicity for goods here as an example.
|Add Bidder||Add Good||Incr. Budget||Incr. Value|
|Rev.||Can go down|
|SW||Can go down||Can go down||Can go down|
In fppe, adding a good weakly increases revenue.
Let be the fppe for , , and let be the fppe for , which includes the new good . We first prove that for all bidders : Suppose there are bidders whose multipliers go up (strictly); consider the set of all such bidders . Collectively, these bidders are now winning weakly more goods (because there are more goods and nobody else’s (paced) bids went up). That means they are, collectively, paying strictly more (it’s first price and they’re bidding higher). But this is impossible, because all of them were running out of budget before (since they were paced).
Using the fact that , any bidder who was paced in is still paced in and spending her whole budget. Let be the set of buyers whose pacing multiplier hasn’t changed, i.e. . They must win weakly more items: Any item they were tied originally with bidders outside must now go completely to bidders in . Additionally, bidders in may win (part of) the new item. Since the pacing multipliers of bidders in did not change, their prices did not change, hence winning weakly more items means they’re spending weakly more.
So bidders whose pacing multiplier changed are spending the same, and the remaining bidder spend weakly more. Hence revenue is weakly higher. ∎
For social welfare, monotonicity is only maintained for goods. Adding bidders, or increasing budgets or valuations, can lead to drops in social welfare. The cause of nonmonotonicity is that there can be a mismatch between valuation and budget: a high-value but low-budget bidder can be lose out to a low-value high-budget bidder. Due to space constraints the proofs for social welfare appear in the appendix.
We now investigate the sensitivity of fppe to budget changes. An overview of our results is shown in Table 2. When adding to the budget of a bidder, revenue can only increase, and at most by . This shows that fppe is, in a sense, revenue (and thus paced-welfare) stable with respect to budget changes: the change in revenue is at most the same as the change in budget. In contrast to this, Conitzer et al. (2018) show that in SPPE revenue can change drastically, at least by a factor of . The proofs are in the appendix.
|Decrease UB||Increase UB|
For social welfare, due to the nature of multiplicative pacing additive bounds (such as the ones given for revenue) don’t immediately make sense.333To see why, take any instance with budget-constrained bidders and compare it with an instance where the valuations are multiplied by 2. Changing a budget will yield the same allocation for both instances (and pacing multipliers are precisely a factor 2 off), but the change in social welfare will be twice as large in the second instance. Therefore we focus on sensitivity results for a relative change in budget, leading to a relative change in social welfare.
Our social welfare proofs rely on the fact that when a budget changes by factor , pacing multipliers can only change by at most a factor .
In fppe, changing one bidder’s budget for , yields fppe with .
Fix instance with fppe , let and let be the fppe for . Note that is a bfpm for , so by Corollary 1 . For the other inequality, note that , forms a bfpm for the original instance : all prices drop by exactly a factor , which means that with the same allocation , spend for all bidders goes down by a factor so no bidder exceeds their budget. By Corollary 1 the pacing multipliers of the fppe on can only be higher, yielding . Rearranging yields the claim. ∎
To complete the proofs for social welfare, note that in an fppe, pacing multipliers correspond to the bang-for-buck of buyers (i.e., the ratio between value and spend), so the bound in revenue change implies a bound in social welfare change. The proofs are given in the appendix.
Algorithms via Convex Programming
We now turn to computing the fppe corresponding to an instance and adapt a well-known method for competitive equilibria. Solutions to the Eisenberg-Gale convex program for Fisher markets with quasi-linear utilities correspond exactly to fppe in our setting. Cole et al. (2017) give the following primal convex program (as well as a dual not included here) for computing a solution to a Fisher market with quasi-linear utilities.
The variables denote the amount of item that bidder wins, being nonzero denotes bidder saving some of their budget, and denotes a measure of utility for bidder (exactly their utility when , otherwise it is not exact).
The leftover budget is denoted by , it arises from the dual program: it is the dual variable for the dual constraint , which constrains bidder to paying at most a cost-per-utility rate of . See Cole et al. (2017) for the dual.
We now show via Fenchel duality that computes an fppe. Informally, the result follows because specifies a single utility rate per bidder, duality guarantees that any item allocated to has exactly rate , and thus since is known to compute a competitive equilibrium we have shown that it computes an erce. Theorem 2 then gives the result.
An optimal solution to corresponds to a fppe with pacing multiplier and allocation , and vice versa.
We start by listing the primal KKT conditions:
It is easy to see that is a valid allocation: has the exact packing constraints. Budgets are also satisfied (here we may assume since otherwise budgets are satisfied since the bidder wins no items): by KKT condition 1 and KKT condition 7 we have that for any item that bidder is allocated part of:
If then summing over all gives
This part of the budget argument is exactly the same as for the standard Eisenberg-Gale proof (Nisan et al., 2007). Note that (1) always holds exactly since the objective is strictly increasing in . Thus denotes full budget expenditure. If then KKT condition 6 implies that which implies . This gives:
This shows that denotes the leftover budget.
If bidder is winning some of item () then KKT condition 7 implies that the price on item is , so bidder is paying their bid as is necessary in a first-price auction. Bidder is also guaranteed to be among the highest bids for item : KKT conditions 7 and 3 guarantee for all .
Finally each bidder either spends their entire budget or is unpaced: KKT condition 6 says that if (that is, some budget is leftover) then , so the bidder is unpaced.
Now we show that any FPPE satisfies the KKT conditions for . We set and use the allocation from the FPPE. We set if , otherwise we set it to . We set equal to the utility of each bidder. KKT condition 1 is satisfied since each bidder either gets a utility rate of if they are unpaced and so or their utility rate is so they spend their entire budget for utility . KKT condition 2 is satisfies since . KKT condition 3 is satisfied since each item bidder wins has price-per-utility , and every other item has a higher price-per-utility. KKT conditions (4) and (5) are trivially satisfied by the definition of FPPE. KKT condition 6 is satisfied by our solution construction. KKT condition 7 is satisfied because a bidder being allocated any amount of item means that they have a winning bid, and their bid is equal to . ∎
This shows that we can use to compute an fppe. Cole et al. (2017) show that admits rational equilibria, and thus an fppe can be computed in polynomial time with the ellipsoid method as long as all inputs are rational. Furthermore, the relatively simple structure of means that it can easily be solved via standard convex-programming packages such as CVX (Grant and Boyd, 2008, 2014) or scalable first-order methods.
The equivalence between solutions to and fppe provides an alternative view on many of our results. Since Theorem 3 can be shown directly via Fenchel duality (as we do in the appendix), it allows us to prove via duality theory that fppe corresponds to erce, and that fppe always exists ( is easily seen to always be feasible and the feasible set is compact. Thus always has a solution. By Theorem 3 that solution will be an fppe.).
We investigated the properties of fppe via numerical simulations. We aimed to answer two questions: (1) Under fppe, how high is bidder regret for reporting truthfully? (2) How does fppe compare to sppe in terms of revenue and social welfare?
To investigate these questions, we generated instances according to the complete-graph model by Conitzer et al. (2018). In this model, every bidder is interested in every item, and each valuation is drawn i.i.d. from unif. We generated instances for each point in the Cartesian product of bidders and goods. For each instance, we computed an fppe as the solution to , computed with CVX (Grant and Boyd, 2014). We computed an sppe for every objective function using the MIP given by Conitzer et al. (2018). We considered at most bidders and goods because of the limited scalability of the sppe MIP; we were able to solve all instances in less than 2ms. Figure 4 in the appendix shows the distribution of pacing multipliers; almost all bidders are budget constrained.
First we look at the ex-post regret that each bidder has in fppe as compared to being able to unilaterally deviate, while keeping the fppe multipliers fixed for all other bidders. We consider deviation either by individually setting bids in each auction, or choosing their own pacing multiplier after the fact. The former corresponds to a setting where bidders can interact with individual auctions. The latter corresponds to online ad-auction markets, where bidders often only specify a value for a conversion, targeting criteria, and a budget, whereas the individual auction valuations are based on conversion value scaled by a conversion rate (that the bidder cannot set). Changing the value for a conversion or the budget will affect all paced bids proportionately. The regrets are computed under the assumption that the valuations are truthful; alternatively this can be thought as the regret that the proxy agent has for not adjusting bids or multipliers after the fact. The results are shown in Figure 1
. The figure shows summary statistics over max relative ex-post regret, which is the fraction of the truthful-response value that the bidder improves by if they deviate. For each instance, for each bidder, we compute the optimal best response, subject to budget constraints (in practice, we compute this by computing the optimal best response for second-price auctions; the bidder could achieve this result by sufficiently shading each bid to equal the bid of the next-highest bidder for every auction it wants to win). The max is over bidders in the auction, and the statistic is across instances. The middle line on each box is the median; the lower and upper hinges show the first and third quartiles. The line extending from the box shows outliers within 1.5 times the inter-quartile range. When the bidders are able to individually set bids in auctions the max regret is sometimes quite high, although it goes down as market thickness increases (note that market thickness is likely much higher in real-world auctions as compared to the at-most-10-bidder instances used here). On the other hand, when bidders are only able to set multipliers, as is often the case in ad-auction markets, we see that regret goes down rapidly, and already with 6-bidder instances the regret is usually near zero. Thusfppe might indeed be an attractive solution concept for thick markets where bidders end up with (near) best responses.
We found that bidders have low ex-post regret as soon as markets have more than a few bidders. However another issue we may worry about is whether bidders can influence the fppe outcome itself by misreporting their input to the fppe computation. Figure 2 shows results for when bidders can misreport by scaling their valuation and budgets by multipliers times their actual amounts. Already with 4 bidders there is practically never an incentive to do this: Only a few outlier instances have nonzero gain.
Secondly we compare revenue and social welfare under fppe and sppe. The results are shown in Figure 3. The left figure shows the cdf over the ratio of fppe revenue and sppe revenue, while the right figure shows the cdf over the ratio of fppe welfare and sppe welfare. We see that fppe revenue is always higher than sppe revenue, though it is the same for about of instances, and almost never more than times as high. For welfare we find that, perhaps surprisingly, neither solution concept is dominating, with most instances having relatively similar welfare in either solution concept, though fppe does slightly better. There are two caveats to keep in mind for these results: firstly we did not compute the social-welfare-maximizing sppe so it is possible that there is a better one (although this is highly unlikely given that Conitzer et al. (2018) find that there’s usually a single unique equilibrium in this class of instances); secondly almost every bidder is budget constrained in the fppe of our setting, and so this might not generalize to settings where many bidders are not budget constrained (see the appendix for statistics on multipliers in the two solution concepts). These experiments show that fppe are not necessarily worse than sppe for welfare (at least with nonstrategic bidders), while potentially having significantly higher revenue.
In an ad platform, we must continually remember that the auction is only a small piece of a larger, complex system; when setting auction rules it is not just the properties of the auction that matter, but the platform’s consequent aggregate behavior. In this paper, we have seen that the equilibrium properties of an ad platform in which a first-price auction is used to sell each impression are in fact quite good, in many ways better than those when a second-price auction is used Conitzer et al. (2018).
In retrospect, the benefits of using a first-price auction are not surprising. In simple settings, second-price auctions win most theoretical head-to-head contests over first-price auctions; however, it is well-known that the luster of the second price auction fades as it is generalized to a Vickrey-Clarke-Groves (VCG) auction, so much that VCG earned the title “lovely but lonely” for its lack of use in practice Ausubel and Milgrom (2006). Indeed, some of the strengths of an ad platform based on first-price auctions are analogous to those seen in other complex auction settings Milgrom (2004) — uniqueness of equilibria, relation to competitive equilibria and core membership, shill-proofness and false-name-proofness, etc. — suggesting that first-price auctions may, in fact, have a serious role to play in today’s ad marketplaces.
- Abrams et al. (2008) Abrams, Z.; Sathiya Keerthi, S.; Mendelevitch, O.; and Tomlin, J. 2008. Ad delivery with budgeted advertisers: A comprehensive lp approach. 9.
- Akbarpour and Li (2018) Akbarpour, M., and Li, S. 2018. Credible mechanisms. In Proceedings of the 2018 ACM Conference on Economics and Computation, Ithaca, NY, USA, June 18-22, 2018, 371.
- Ausubel and Milgrom (2006) Ausubel, L. M., and Milgrom, P. 2006. The lovely but lonely vickrey auction. In Combinatorial Auctions, chapter 1. MIT Press.
- Azar et al. (2009) Azar, Y.; Birnbaum, B.; Karlin, A. R.; and Nguyen, C. T. 2009. On revenue maximization in second-price ad auctions. In Fiat, A., and Sanders, P., eds., Algorithms - ESA 2009, 155–166. Berlin, Heidelberg: Springer Berlin Heidelberg.
- Balseiro and Gur (2017) Balseiro, S., and Gur, Y. 2017. Learning in repeated auctions with budgets: Regret minimization and equilibrium. Available at SSRN 2921446.
- Balseiro et al. (2017) Balseiro, S.; Kim, A.; Mahdian, M.; and Mirrokni, V. 2017. Budget management strategies in repeated auctions. In Proceedings of the 26th International World Wide Web Conference, Perth, Australia.
- Borgs et al. (2007) Borgs, C.; Chayes, J.; Immorlica, N.; Jain, K.; Etesami, O.; and Mahdian, M. 2007. Dynamics of bid optimization in online advertisement auctions. In Proceedings of the 16th international conference on World Wide Web.
- Cary et al. (2007) Cary, M.; Das, A.; Edelman, B.; Giotis, I.; Heimerl, K.; Karlin, A. R.; Mathieu, C.; and Schwarz, M. 2007. Greedy bidding strategies for keyword auctions. In MacKie-Mason, J. K.; Parkes, D. C.; and Resnick, P., eds., EC, 262–271. ACM.
- Chen (2017) Chen, Y. 2017. Programmatic advertising is preparing for the first-price auction era. https://digiday.com/marketing/programmatic-advertising-readying-first-price-auction-era/. Accessed: 2018-08-30.
- Cole et al. (2017) Cole, R.; Devanur, N.; Gkatzelis, V.; Jain, K.; Mai, T.; Vazirani, V. V.; and Yazdanbod, S. 2017. Convex program duality, fisher markets, and nash social welfare. In Proceedings of the 2017 ACM Conference on Economics and Computation, 459–460. ACM.
- Conitzer et al. (2018) Conitzer, V.; Kroer, C.; Sodomka, E.; and Stier-Moses, N. E. 2018. Multiplicative pacing equilibria in auction markets. In Conference on Web and Internet Economics (WINE’18).
- Dütting, Fischer, and Parkes (2018) Dütting, P.; Fischer, F.; and Parkes, D. C. 2018. Expressiveness and robustness of first-price position auctions. Mathematics of Operations Research.
- Edelman and Ostrovsky (2007) Edelman, B., and Ostrovsky, M. 2007. Strategic bidder behavior in sponsored search auctions. Decision Support Systems 43(1):192–198.
- Feldman et al. (2007) Feldman, J.; Muthukrishnan, S.; Pal, M.; and Stein, C. 2007. Budget optimization in search-based advertising auctions. In Proceedings of the 8th ACM conference on Electronic commerce.
- Goel et al. (2010) Goel, A.; Mahdian, M.; Nazerzadeh, H.; and Saberi, A. 2010. Advertisement allocation for generalized second-pricing schemes. Oper. Res. Lett. 38(6):571–576.
- Grant and Boyd (2008) Grant, M., and Boyd, S. 2008. Graph implementations for nonsmooth convex programs. In Blondel, V.; Boyd, S.; and Kimura, H., eds., Recent Advances in Learning and Control, Lecture Notes in Control and Information Sciences. Springer-Verlag Limited. 95–110.
- Grant and Boyd (2014) Grant, M., and Boyd, S. 2014. CVX: Matlab software for disciplined convex programming, version 2.1. http://cvxr.com/cvx.
- Hosanagar and Cherepanov (2008) Hosanagar, K., and Cherepanov, V. 2008. Optimal bidding in stochastic budget constrained slot auctions. In Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), Chicago, IL, USA, June 8-12, 2008, 20.
- Karande, Mehta, and Srikant (2013) Karande, C.; Mehta, A.; and Srikant, R. 2013. Optimizing budget constrained spend in search advertising. In Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, WSDM ’13, 697–706. New York, NY, USA: ACM.
- Mehta et al. (2007) Mehta, A.; Saberi, A.; Vazirani, U.; and Vazirani, V. 2007. Adwords and generalized online matching. Journal of the ACM (JACM) 54(5).
- Mehta (2013) Mehta, A. 2013. Online matching and ad allocation. Foundations and Trends® in Theoretical Computer Science 8(4):265–368.
- Milgrom (2004) Milgrom, P. 2004. Putting Auction Theory to Work. Cambridge University Press.
Nisan et al. (2007)
Nisan, N.; Roughgarden, T.; Tardos, E.; and Vazirani, V. V.
Algorithmic game theory. Cambridge university press.
- Rusmevichientong and Williamson (2006) Rusmevichientong, P., and Williamson, D. P. 2006. An adaptive algorithm for selecting profitable keywords for search-based advertising services. In Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), Ann Arbor, Michigan, USA, June 11-15, 2006, 260–269.
- Sluis (2017) Sluis, S. 2017. Big changes coming to auctions, as exchanges roll the dice on first-price. https://adexchanger.com/platforms/big-changes-coming-auctions-exchanges-roll-dice-first-price/. Accessed: 2018-08-30.
Appendix A Omitted Monotonicity and Sensitivity Proofs
In fppe, adding a bidder weakly increases revenue.
Let be the original set of bidders, a new bidder, and the set of goods. Let be the fppe on and . After adding bidder , for each bidder and good , let and . Set for bidder and good , to obtain . By construction is a bfpm, so by Lemma 2, the revenue of the fppe for and must be at least as high. ∎
In fppe, increasing a bidder’s budget from to weakly increases revenue.
Let be the fppe where the budget of bidder is still . After increasing the budget to , is still a bfpm. Therefore, by Lemma 2, the revenue of the new fppe weakly increases. ∎
In fppe, increasing a bidder ’s value for some good from to can decrease revenue.
Consider the following instance: 2 bidders, 2 goods, , , with . The fppe will be , . Both bidders are spending their whole budget for total revenue .
However, consider . The fppe is now . The bidders still receive the same goods, but the price for the first good dropped to for total revenue of instead of . ∎
In fppe, adding a bidder can decrease social welfare by a factor .
Consider the following instance: 1 bidder, 1 good. We have for some parameter and . The fppe is for social welfare .
Now add bidder with . The new fppe is and . Social welfare now is . As , the new social welfare is half of what it was before. ∎
In fppe, adding a good weakly increases social welfare.
Fix , , and additional good . Let be the fppe for and , the fppe for and let be the set of bidders who are paced in , i.e. . We’ll compare the contribution to social welfare of and separately.
First the set . From the proof of Proposition 3, adding a good weakly decreases pacing multipliers. Since the bidders in spent their entire budget in , they must also spend their entire budget in . The bang-per-buck of bidder is , since by Definition 1 they pay per unit of good , and they receive of value per unit of good . Since pacing multipliers weakly decreased, the bang-per-buck of bidders in weakly increased, and as they spend their entire budget, their contribution to social welfare weakly increased.
Now the set . By Proposition 3, the total revenue weakly increased. Since the bidders in spend exactly the same amount as before, the increase in revenue must have come from bidders in . Moreover, they were unpaced in and so had a bang-for-buck of . In , they have back-for-buck at least , hence their contribution to social welfare weakly increased.
Since the contribution to social welfare weakly increased for both sets and , the total social welfare weakly increased. ∎
In fppe, increasing a bidder’s budget from to can decrease social welfare.
Consider the following instance (which is similar to the one in Proposition 7): 2 bidders, 1 good. We have values and budgets . The fppe is for total social welfare of .
Now increase bidder ’s budget to . The new fppe is for total social welfare of . As , we lose of the social welfare. ∎
In fppe, increasing a bidder ’s value for some good from to can decrease social welfare.
Consider the following instance: 2 bidders, 1 good. We have values , and budgets . The fppe is and , for total social welfare . Now increase . The new fppe will have , and for social welfare of , as we lose of the social welfare. ∎
In fppe, increasing a bidder ’s budget by , i.e. , yields a revenue increase of at most .
Fix instance , and let be the budget profile where for some bidder . Let be the fppe on , and let be the fppe on . Since is a bfpm for the new instance, we have , the new pacing multipliers are weakly higher than the old pacing multipliers. Let be the bidders for whom , and let be the revenue from them in . Since the pacing multipliers for all bidders in strictly increased, they must have had , so by the definition of a fppe they must have spent their entire budget and . In the new fppe, they can’t spend more than their budget, so .
What’s left to show is that the revenue from the bidders with cannot have gone up. If there were any goods that and were tied for, then after increasing the pacing multipliers of , the prices of those goods increased and won all of them. Moreover, the prices of goods that as a set still win have not changed. Thus is winning a subset of the goods they won previously at the same per-unit cost, hence their spend cannot have gone up. ∎
Along with Proposition 5, this shows that when a bidder’s budget increases by , . It’s not difficult to see that these extremes can also both be attained: for the lower bound, increasing the budget of a non-budget-constrained bidder will not change the fppe, hence revenue is unchanged. On the upper bound, take 1 bidder, 1 good, . Setting will increase revenue by .
From Proposition 9 below, we know that social welfare can decrease when we increase a bidder’s budget. The following lemma bounds that loss. In the following, let be the social welfare prior to changing the budget, and be the social welfare after changing the budget.
In fppe, changing one bidder’s budget for , yields .
Let be the bidder with . Let be the fppe before the change, and let be the fppe after the budget change. Let be the set of bidders who are paced in , and let the unpaced bidders. We’ll lower-bound the new revenue from and separately.
For the bidders in , they spent their entire budget in both and : by Lemma 5 hence bidders that are paced in are also paced in and by the definition of fppe that means they spend their entire budget. Moreover, by Lemma 5, their pacing multipliers cannot have gone up by more than , hence their bang-per-buck is at least that in . Combining these statements, in bidders in spend at least as much as in , and their bang-per-buck is at least times that in , hence their contribution to social welfare for each , and therefore .
For the set of bidders who are unpaced in , their combined decrease in spend can be at most : the total spend cannot have decreased by Prop 5, bidder ’s spend increased by at most , the paced bidders (excluding bidder ) in were also all paced in so their spend stayed constant, hence the largest possible reduction in spend by unpaced bidders in is . For unpaced bidders, spend equals contribution to social welfare, so we have .
Combining everything, we have . ∎
In fppe, changing one bidder’s budget for , yields .
Let be the bidder whose budget increases from to . Let be the fppe before the change, and be the fppe after the budget change. By Lemma 5, increasing a budget can only increase pacing multipliers. Let be the set of bidders whose pacing multiplier increased (for convenience excluding bidder ), let be the set who had pacing multiplier strictly lower than whose multiplier did not change, and let be the set of bidders who were unpaced in . Let be the old social welfare, and the new one. Define , , , and as the contribution to social welfare of bidder , bidders , , and respectively.
We use extensively that at pacing multiplier , the spend .
For bidder , we have . The pacing multiplier of can only have increased, so the bang-for-buck can only have decreased. Spend increased at most by , back-for-buck was at most the same, hence cannot be more than more.
For bidders , we have . Their spend cannot have increased as they spent their budget completely in . Meanwhile, their bang-for-buck strictly decreased due to increasing pacing multipliers.
For bidders , we have . Since they were and are paced, they must spend their entire budget. Since their pacing multiplier hasn’t changed, their bang-for-buck stayed the same. Thus their contribution to SW stayed the same.
Finally, for bidders , we have . From the proof of prop. S4, the total spend of bidders cannot have increased. Since the spend of bidders in must have stayed the same, the spend of bidders in cannot have increased. Since their bang-for-buck is , their SW cannot have increased.
Summing over all groups: . ∎