Related papers: All-Pay Auctions with Different Forfeits
In an all-pay auction, only one bidder wins but all bidders must pay the auctioneer. All-pay bidding games arise from attaching a similar bidding structure to traditional combinatorial games to determine which player moves next. In contrast…
All-pay auctions, a common mechanism for various human and agent interactions, suffers, like many other mechanisms, from the possibility of players' failure to participate in the auction. We model such failures, and fully characterize…
The all-pay auction, a classic competitive model, is widely applied in scenarios such as political elections, sports competitions, and research and development, where all participants pay their bids regardless of winning or losing. However,…
When opposing parties compete for a prize, the sunk effort players exert during the conflict can affect the value of the winner's reward. These spillovers can have substantial influence on the equilibrium behavior of participants in…
We study multi-unit auctions in which bidders have limited knowledge of opponent strategies and values. We characterize optimal prior-free bids; these bids minimize the maximal loss in expected utility resulting from uncertainty surrounding…
This note pursues two primary objectives. First, we analyze the outcomes of an all-pay auction within a store where buyers with and without financial constraints arrive at varying rates, and where buyer types are private information.…
Models of auctions or tendering processes are introduced. In every round of bidding the players select their bid from a probability distribution and whenever a bid is unsuccessful, it is discarded and replaced. For simple models, the…
We study the optimal auction design problem when bidders' preferences follow the maxmin expected utility model. We suppose that each bidder's set of priors consists of beliefs close to the seller's belief, where "closeness" is defined by a…
One method to offer some bidders a discount in a first-price auction is to augment their bids when selecting a winner but only charge them their original bids should they win. Another method is to use their original bids to select a winner,…
In many first-price auctions, bidders face considerable strategic uncertainty: They cannot perfectly anticipate the other bidders' bidding behavior. We propose a model in which bidders do not know the entire distribution of opponent bids…
We explore an application of all-pay auctions to model trade wars and territorial annexation. Specifically, in the model we consider the expected resource, production, and aggressive (military/tariff) power are public information, but…
A seller with one unit of a good faces N\geq3 buyers and a single competitor who sells one other identical unit in a second-price auction with a reserve price. Buyers who do not get the seller's good will compete in the competitor's…
In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In {\em bidding…
We consider a class of auctions (Lowest Unique Bid Auctions) that have achieved a considerable success on the Internet. Bids are made in cents (of euro) and every bidder can bid as many numbers as she wants. The lowest unique bid wins the…
In many applications, ads are displayed together with the prices, so as to provide a direct comparison among similar products or services. The price-displaying feature not only influences the consumers' decisions, but also affects the…
In economics, there are many ways to describe the interaction between a "seller" and a "buyer". The most common one, with which we interact almost every day, is selling for a fixed price. This option is perfect for selling a mass product,…
Real-Time Bidding is a new Internet advertising system that has become very popular in recent years. This system works like a global auction where advertisers bid to display their impressions in the publishers' ad slots. The most popular…
We describe human-subject laboratory experiments on probabilistic auctions based on previously proposed auction protocols involving the simulated manipulation and communication of quantum states. These auctions are probabilistic in…
We study auctions whose bidders are embedded in a social or economic network. As a result, even bidders who do not win the auction themselves might derive utility from the auction, namely, when a friend wins. On the other hand, when an…
In a multi-battle contest, each time a player competes by investing some of her budgets or resources in a component battle to collect a value if winning the battle. There are multiple battles to fight, and the budgets get consumed over…