Preserving Bidder Privacy in Assignment Auctions: Design and Measurement

References

• Adomavicius G, Curley SP, Gupta A (2013) Impact of information feedback in continuous combinatorial auctions: An experimental study of economic performance. Management Inform. Systems Quart. 37(1):55–76.Crossref, Google Scholar
• Adomavicius G, Gupta A (2005) Toward comprehensive real-time bidder support in iterative combinatorial auctions. Inform. Systems Res. 16(2):169–185.Link, Google Scholar
• Akgül M (1992) The linear assignment problem. Akgül M, Hamacher HW, Tüfekçi S, eds. Combinatorial Optimization—New Frontiers in Theory and Practice (Springer, Berlin), 85–122.Crossref, Google Scholar
• Andersson T, Andersson C, Talman AJJ (2013) Sets in excess demand in simple ascending auctions with unit-demand bidders. Ann. Oper. Res. 211(1):27–36.Crossref, Google Scholar
• Arrow KJ (1972) The value of and the demand for information. McGuire CB, Radner R, eds. Decision and Organization: A Volume in Honor of Jacob Marschak (North-Holland, Amsterdam), 131–139.Google Scholar
• Ausubel L (2004) An efficient ascending-bid auction for multiple objects. Amer. Econom. Rev. 94(5):1452–1475.Crossref, Google Scholar
• Ausubel LM (2006) An efficient dynamic auction for heterogeneous commodities. Amer. Econom. Rev. 96(3):602–629.Crossref, Google Scholar
• Ausubel LM, Cramton P (2006) Dynamic auctions in procurement. Dimitri N, Piga G, Spagnolo G, eds. Handbook of Procurement (Cambridge University Press, Cambridge, UK), 220–245.Crossref, Google Scholar
• Ausubel LM, Milgrom PR (2002) Ascending auctions with package bidding. Adv. Theoret. Econom. 1(1):1–42.Google Scholar
• Bapna R, Das S, Day R, Garfinkel R, Stallaert J (2011) A clock-and-offer auction market for grid resources when bidders face stochastic computational needs. INFORMS J. Comput. 23(4):630–647.Link, Google Scholar
• Bapna R, Das S, Garfinkel R, Stallaert J (2008) A market design for grid computing. INFORMS J. Comput. 20(1):100–111.Link, Google Scholar
• Basu D (1975) Statistical information and likelihood. Sankhya Ser. A 37(1):1–71.Google Scholar
• Baudron O, Stern J (2002) Non-interactive private auctions. Syverson P, ed. Financial Cryptography (Springer, Berlin), 364–377.Crossref, Google Scholar
• Bichler M, Goeree JK (2017) Handbook of Spectrum Auction Design (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Bichler M, Gupta A, Ketter W (2010) Research commentary—Designing smart markets. Inform. Systems Res. 21(4):688–699.Link, Google Scholar
• Bichler M, Hao Z, Adomavicius G (2017) Coalition-based pricing in ascending combinatorial auctions. Inform. Systems Res. 28(1):159–179.Link, Google Scholar
• Bichler M, Shabalin P, Pikovsky A (2009) A computational analysis of linear price iterative combinatorial auction formats. Inform. Systems Res. 20(1):33–59.Link, Google Scholar
• Bichler M, Shabalin P, Ziegler G (2013) Efficiency with linear prices? A game-theoretical and computational analysis of the combinatorial clock auction. Inform. Systems Res. 24(2):394–417.Link, Google Scholar
• Bikhchandani S, Ostroy JM (2002) The package assignment model. J. Econom. Theory 107(2):377–406.Crossref, Google Scholar
• Board S (2009) Revealing information in auctions: The allocation effect. Econom. Theory 38(1):125–135.Crossref, Google Scholar
• Bogetoft P, Christensen DL, Damgård I, Geisler M, Jakobsen T, Krøigaard M, Nielsen JD, et al. (2009) Secure multiparty computation goes live. Dingledine R, Golle P, eds. Review: Literature and Arts of the Americas (Springer, Berlin), 325–343.Google Scholar
• Boyle P, Broadie M, Glasserman P (1997) Monte Carlo methods for security pricing. J. Econom. Dynam. Control 21(8–9):1267–1321.Crossref, Google Scholar
• Brandt F (2006) How to obtain full privacy in auctions. Internat. J. Inform. Security 5(4):201–216.Crossref, Google Scholar
• Brandt F, Sandholm T (2005) Efficient privacy-preserving protocols for multi-unit auctions. Patrick AS, Yung M, eds. Financial Cryptography and Data Security, Lecture Notes in Computer Science, vol. 3570 (Springer, Berlin), 298–312.Crossref, Google Scholar
• Brandt F, Sandholm T (2008) On the existence of unconditionally privacy-preserving auction protocols. ACM Trans. Inform. Systems Security 11(2):1–21.Crossref, Google Scholar
• Burkard RE, Çela E (1999) Linear assignment problems and extensions. Du D-Z, Pardalos PM, eds. Handbook of Combinatorial Optimization (Springer, Boston), 75–149.Crossref, Google Scholar
• Cabrales A, Gossner O, Serrano R (2013) Entropy and the value of information for investors. Amer. Econom. Rev. 103(1):360–377.Crossref, Google Scholar
• Clemente M, Fanti MP, Ukovich W (2014) Smart management of electric vehicles charging operations: The vehicle-to-charging station assignment problem. IFAC Proc. 47(3):918–923.Crossref, Google Scholar
• Cover TM, Thomas JA (1991) Elements of Information Theory, vol. 2, 2nd ed. (John Wiley & Sons, New York).Crossref, Google Scholar
• Cramton P (2006) Simultaneous ascending auctions. Cramton P, Shoham Y, Steinberg R, eds. Combinatorial Auctions (MIT Press, Cambridge, MA), 99–144.Google Scholar
• Crawford VP, Knoer EM (1981) Job matching with heterogeneous firms and workers. Econometrica 49(2):437–450.Crossref, Google Scholar
• de Vries S, Schummer J, Vohra RV (2007) On ascending Vickrey auctions for heterogeneous objects. J. Econom. Theory 132(1):95–118.Crossref, Google Scholar
• Demange G, Gale D, Sotomayor M (1986) Multi-item auctions. J. Political Econom. 94(4):863–872.Crossref, Google Scholar
• Demski JS (1973) The general impossibility of normative accounting standards. Accounting Rev. 48(4):718–723.Google Scholar
• Feldman J, Henzinger M, Korula N, Mirrokni VS, Stein C (2010) Online stochastic packing applied to display ad allocation. de Berg M, Meyer U, eds. Proc. Eur. Sympos. Algorithms 2010 (Springer, Berlin), 182–194.Google Scholar
• Ford LR, Fulkerson DR (1962) Flows in Networks (RAND Corporation, Santa Monica, CA).Crossref, Google Scholar
• Gale D, Shapley LS (1962) College admissions and the stability of marriage. Amer. Math. Monthly 69(1):9–15.Crossref, Google Scholar
• Gul F, Stacchetti E (1999) Walrasian equilibrium with gross substitutes. J. Econom. Theory 87(1):95–124.Crossref, Google Scholar
• Gul F, Stacchetti E (2000) The English auction with differentiated commodities. J. Econom. Theory 92(1):66–95.Crossref, Google Scholar
• Harkavy M, Tygar J, Kikuchi H (1998) Electronic auctions with private bids. Proc. 3rd Conf. USENIX Workshop Electronic Commerce (USENIX Association, Berkeley, CA), 61–73.Google Scholar
• Ho C-J, Vaughan J (2012) Online task assignment in crowdsourcing markets. Proc. 26th AAAI Conference Artificial Intelligence (Association for the Advancement of Artificial Intelligence, Palo Alto, CA), 45–51.Google Scholar
• Juels A, Szydlo M (2003) A two-server, sealed-bid auction protocol. Blaze M, ed. Financial Cryptography (Springer, Berlin), 72–86.Crossref, Google Scholar
• Klemperer P (2002) What really matters in auction design. J. Econom. Perspect. 16(1):169–189.Crossref, Google Scholar
• Kuhn H (1955) The Hungarian method for the assignment problem. Naval Res. Logistics Quart. 5(2):83–97.Crossref, Google Scholar
• Leonard H (1983) Elicitation of honest preferences for the assignment of individuals to positions. J. Political Econom. 91(3):461–479.Crossref, Google Scholar
• Lewis G (2011) Asymmetric information, adverse selection and online disclosure: The case of eBay Motors. Amer. Econom. Rev. 101(4):1535–1546.Crossref, Google Scholar
• Lindley D (1956) On a measure of the information provided by an experiment. Ann. Math. Statist. 27(4):986–1005.Crossref, Google Scholar
• Lucking-Reiley D (2000) Vickrey auctions in practice: From nineteenth-century philately to twenty-first-century e-commerce. J. Econom. Perspect. 14(3):183–192.Crossref, Google Scholar
• Marschak J (1959) Remarks on the economics of information. Cowles Foundation Discussion Paper 70, New Haven, CT.Google Scholar
• Marschak J, Radner R (1972) Economic Theory of Teams (Yale University Press, New Haven, CT).Google Scholar
• Milgrom P, Weber R (1982) A theory of auctions and competitive bidding. Econometrica 50(5):1089–1122.Crossref, Google Scholar
• Mishra D, Parkes DC (2007) Ascending price Vickrey auctions for general valuations. J. Econom. Theory 132(1):335–366.Crossref, Google Scholar
• Mishra D, Parkes DC (2009) Multi-item Vickrey-Dutch auctions. Games Econom. Behav. 66(1):326–347.Crossref, Google Scholar
• Mishra D, Talman D (2010) Characterization of the Walrasian equilibria of the assignment model. J. Math. Econom. 46(1):6–20.Crossref, Google Scholar
• Moldovanu B (2012) Auction theory and applications. Bonn J. Econom. 1(1):53–64.Google Scholar
• Montenegro JA, Lopez J (2014) A practical solution for sealed bid and multi-currency auctions. Comput. Security 45:186–198.Crossref, Google Scholar
• Morokoff WJ, Caflisch RE (1995) Quasi-Monte Carlo integration. J. Comput. Phys. 122(2):218–230.Crossref, Google Scholar
• Myerson RB (1981) Optimal auction design. Math. Oper. Res. 6(1):58–73.Link, Google Scholar
• Orlandi C (2011) Is multiparty computation any good in practice? Proc. 2011 IEEE Internat. Conf. Acoustics Speech Signal Processing (ICASSP) (IEEE, New York), 5848–5851.Google Scholar
• Parkes DC (1999) iBundle: An efficient ascending price bundle auction. Proc. 1st ACM Conf. Electronic Commerce (Association for Computing Machinery Press, New York), 148–157.Google Scholar
• Parkes DC (2001) An iterative generalized Vickrey auction: Strategy-proofness without complete revelation. Proc. AAAI Spring Sympos. Game Theoretic Decision Theoretic Agents (AAAI Press, Menlo Mark, CA), 78–87.Google Scholar
• Parkes DC (2002) Price-based information certificates for minimal-revelation combinatorial auctions. Padget J, Shehory O, Parkes D, Sadeh N, Walsh WE, eds. Agent-Mediated Electronic Commerce IV. Designing Mechanisms and Systems, Lecture Notes in Artificial Intelligence, vol. 2531 (Springer, Berlin), 253–276.Crossref, Google Scholar
• Peng L (2005) Learning with information capacity constraints. J. Financial Quant. Anal. 40(2):307–329.Crossref, Google Scholar
• Perry M, Reny PJ (2005) An efficient multi-unit ascending auction. Rev. Econom. Stud. 72(2):567–592.Crossref, Google Scholar
• Petrakis I, Ziegler G, Bichler M (2013) Ascending combinatorial auctions with allocation constraints: On game theoretical and computational properties of generic pricing rules. Inform. Systems Res. 24(3):768–786.Link, Google Scholar
• Rhodes-Kropf M, Katzman B (2008) The consequences of information revealed in auctions. Appl. Econom. Res. Bull. 1(March):53–87.Google Scholar
• Rothkopf MH, Teisberg TJ, Kahn EP (1990) Why are Vickrey auctions rare? J. Political Econom. 98(1):94–109.Crossref, Google Scholar
• Sankaran K (1994) On a dynamic auction mechanism assignment problem. Math. Social Sci. 28(2):143–150.Crossref, Google Scholar
• Shannon CE (1948) A mathematical theory of communication. Bell System Tech. J. 27(3):379–423.Google Scholar
• Shannon CE, Weaver W (1964) The Mathematical Theory of Communication (University of Illinois Press, Urbana).Google Scholar
• Sims CA (2003) Implications of rational inattention. J. Monetary Econ. 50(3):1–28.Crossref, Google Scholar
• Sunderam AV, Parkes DC (2003) Preference elicitation in proxied multiattribute auctions. Proc. 4th ACM Conf. Electronic Commerce (Association for Computing Machinery Press, New York), 214–215.Google Scholar
• Tan X (2016) Information revelation in auctions with common and private values. Games Econom. Behav. 97(May):147–165.Crossref, Google Scholar