Showing 1 - 10 of 1,663
optimal for the seller to do away with any matching considerations and allocate the contract on the basis of price alone. If … matching is sufficiently important to the seller, the optimal mechanism may be implemented without commitment. However, if … matching is not sufficiently important, the seller suffers a loss when he is unable to commit. The magnitude of this loss …
Persistent link: https://www.econbiz.de/10015222623
In many auctions, matching between the bidder and seller raises the value of the contract for both parties. However … depresses bids. The more matching matters, the greater the penalty associated with observing the matches. …
Persistent link: https://www.econbiz.de/10015222624
A tanulmány célja az értékpapírok esetében leggyakrabban alkalmazott két aukciós technika (az egyenáras és a diszkriminatív áras aukció) összehasonlító elemzése. A szakirodalom elsősorban az aukció várható bevétele szempontjából elemzi a módszereket. Az elméleti...
Persistent link: https://www.econbiz.de/10015241420
In a menu auction, players submit bids for all choices the auctioneer A can make, and A then makes the choice that maximizes the sum of bids. In a binomial menu auction (BMA), players submit acceptance sets (indicating which choices they would support), and A chooses the option that maximizes...
Persistent link: https://www.econbiz.de/10015225488
The separation theorem in discrete convex analysis states that two disjoint discrete convex sets can be separated by a hyperplane with a 0-1 normal vector. We apply this theorem to an auction model and provide a unified approach to existing results. When p is not an equilibrium price vector,...
Persistent link: https://www.econbiz.de/10015258385
Using a notion of convexity in discrete convex analysis, we introduce a discrete analogue of the Kuhn-Tucker theorem. We apply it to an auction model and show that existing iterative auctions can be viewed as the process of finding a saddle point of the Lagrange function.
Persistent link: https://www.econbiz.de/10015258862
Using a notion of convexity in discrete convex analysis, we introduce a discrete analogue of the Kuhn-Tucker theorem. We apply it to an auction model and show that existing iterative auctions can be viewed as the process of finding a saddle point of the Lagrange function.
Persistent link: https://www.econbiz.de/10015264655
This paper models frictions in buyer-seller markets using networks, where buyers are linked with a subset of sellers and sellers are linked with a subset of buyers. Sparser networks are associated with higher search frictions. We use the model to characterize pairwise stable allocations and...
Persistent link: https://www.econbiz.de/10015249266
Peters and Severinov (2006) (PS henceforth) characterize a perfect Bayesian equilibrium (PBE) in a competing auctions environment, where all buyers are linked to all the sellers. PS characterize a PBE using a simple bidding rule, whereby buyers select in which auction to bid. In this note we...
Persistent link: https://www.econbiz.de/10015249268
optimisation, BM model, game theory and their valuation as real options is the new direction of further re-search. …
Persistent link: https://www.econbiz.de/10015217436