On the fastest Vickrey algorithm
From MaRDI portal
Publication:1957643
DOI10.1007/S00453-009-9285-4zbMATH Open1202.68497OpenAlexW2154649399MaRDI QIDQ1957643FDOQ1957643
Authors: Yanyan Li
Publication date: 27 September 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-009-9285-4
Recommendations
Analysis of algorithms (68W40) Auctions, bargaining, bidding and selling, and other market models (91B26) Nonnumerical algorithms (68W05)
Cites Work
- Title not available (Why is that?)
- A Concept of Egalitarianism Under Participation Constraints
- Title not available (Why is that?)
- Communication Complexity
- Stochastic dominance and prospect dominance with subjective weighting functions
- Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods
- Groves' Scheme on Restricted Domains
- An axiomatic approach to egalitarianism in TU-games
- Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison
- Characterization of Revenue Equivalence
- Non-cooperative stochastic dominance games
- Title not available (Why is that?)
- Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints
- The private value single item bisection auction
- The communication complexity of private value single-item auctions
- Algorithms - ESA 2003
- Continua of stochastic dominance relations for bounded probability distributions
- Stochastic dominance equilibria in two-person noncooperative games
- On dynamic bit-probe complexity
Cited In (6)
This page was built for publication: On the fastest Vickrey algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1957643)