Characterization and computation of Nash-equilibria for auctions with incomplete information

From MaRDI portal
Publication:1189670

DOI10.1007/BF01271133zbMath0763.90037MaRDI QIDQ1189670

Michael Plum

Publication date: 27 September 1992

Published in: International Journal of Game Theory (Search for Journal in Brave)




Related Items (26)

On the Complexity of Equilibrium Computation in First-Price AuctionsProcurement auctions with capacity constrained suppliersOptimal bidding in auctions from a game theory perspectiveAll equilibria of the multi-unit Vickrey auctionFirst-price auctions where one of the bidders' valuations is common knowledgeAsymmetric auction experiments with(out) commonly known beliefsSynergies are a reason to prefer first-price auctions!Asymmetric auctions with resale: an experimental studyShapley-Folkman-Lyapunov theorem and asymmetric first price auctionsAsymmetric first-price auctions with uniform distributions: analytic solutions to the general caseAll equilibria of the Vickrey auction.Pre-auction offers in asymmetric first-price and second-price auctionsRanking asymmetric auctionsThe effect of bidders' asymmetries on expected revenue in auctionsMultidimensional private value auctionsFirst-price equilibrium and revenue equivalence in a sequential procurement auction modelAsymmetric first price auctionsEfficiency and synergy in a multi-unit auction with and without package bidding: An experimental studyUniform price auctions with a last accepted bid pricing ruleAsymmetric budget constraints in a first-price auctionOn ring formation in auctionsRevenue and efficiency effects of resale in first-price auctionsA first price auction with an arbitrary number of asymmetric biddersRevenue Comparison in Asymmetric Auctions with Discrete ValuationsEx-ante welfare superiority of the Boston mechanism over the deferred acceptance mechanismNumerical Solution of Asymmetric Auctions



Cites Work


This page was built for publication: Characterization and computation of Nash-equilibria for auctions with incomplete information