Filters








16 Hits in 5.7 sec

The Randomized Communication Complexity of Randomized Auctions [article]

Aviad Rubinstein, Junyao Zhao
2021 arXiv   pre-print
We study the communication complexity of incentive compatible auction-protocols between a monopolist seller and a single buyer with a combinatorial valuation function over n items.  ...  We also give nearly matching lower bounds on the expected communication complexity of approximately-revenue-optimal auctions.  ...  communication complexity with two items.  ... 
arXiv:2104.11275v1 fatcat:t5wkl3obpbhhzfsayritpkptcq

Robustness of the incentive compatible combinatorial auction

R. Mark Isaac, Duncan James
2000 Experimental Economics  
Communication Commission's auction of spectrum rights for so-called Personal Communication System services.  ...  QUESTION 5: What level of efficiency does the Vickrey combinatorial auction achieve relative to the "two-bid" auction in a subadditive value, "high information" environment?  ... 
doi:10.1007/bf01669206 fatcat:7ofiz3zvuje4ng7daaiww6bnvu

Implementation in Advised Strategies: Welfare Guarantees from Posted-Price Mechanisms When Demand Queries Are NP-Hard

Linda Cai, Clay Thomas, S. Matthew Weinberg, Michael Wagner
2020 Innovations in Theoretical Computer Science  
Weinberg 61:5 Combinatorial Auctions in the Computational Model.  ...  may have strong implications in the computational model as well (via implementation in advised strategies). Combinatorial Auctions in the Communication Model.  ...  Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers. In the 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2019. 24 Uriel Feige.  ... 
doi:10.4230/lipics.itcs.2020.61 dblp:conf/innovations/CaiTW20 fatcat:xmkaziuibbhqhjkcn337chhnge

Standardizing Interactive Pricing for Electronic Business

Michael Schwind, Oliver Hinz, Tim Stockheim, Martin Bernhardt
2008 Electronic Markets  
ACKNOWLEDGEMENTS This paper originates from research conducted within the framework of the 'Internetökonomie' project funded by the German Federal Ministry of Science and Education (BMBF).  ...  We would like to thank the participating organizations, consortia members, partners and our dear colleagues for their support.  ...  In complex auction settings such as combinatorial auctions, the computation of the optimal allocation requires considerable amounts of time.  ... 
doi:10.1080/10196780802045013 fatcat:xamypl5vfzdobjp3e4yph6srl4

Complement-Free Couples Must Communicate: A Hardness Result for Two-Player Combinatorial Auctions [article]

Tomer Ezra, Michal Feldman, Eric Neyman, Inbal Talgam-Cohen, S. Matthew Weinberg
2018 arXiv   pre-print
We study the communication complexity of welfare maximization in combinatorial auctions with m items and two subadditive bidders.  ...  Finally, we discuss the implications of our results towards combinatorial auctions with strategic bidders.  ...  The work of M.  ... 
arXiv:1811.09871v1 fatcat:d5cim5s75bakpofsk2mbsaghnu

Electronic Markets and Auctions (Dagstuhl Seminar 13461)

Yishay Mansour, Benny Moldovanu, Noam Nisan, Berthold Vöcking, Marc Herbstritt
2014 Dagstuhl Reports  
From the computer science perspective, with the advent of the Internet, there has been a significant amount of work in Algorithmic Game Theory focusing on computational aspects of electronic markets and  ...  The recent emergence of electronic markets and auctions has only reemphasized the importance of this topic.  ...  In particular, we consider two settings: combinatorial auctions with unit demand bidders (bipartite matching) and combinatorial auctions with subadditive bidders.  ... 
doi:10.4230/dagrep.3.11.58 dblp:journals/dagstuhl-reports/MansourMNV13 fatcat:yvkfyeeezrhhnhckygpqseqwx4

Approximately Optimal Mechanism Design [article]

Tim Roughgarden, Inbal Talgam-Cohen
2020 arXiv   pre-print
Rules of thumb produced by the field influence everything from how governments sell wireless spectrum licenses to how the major search engines auction off online advertising.  ...  to the relaxed goal of an approximately optimal mechanism allows us to reason about fundamental questions that seem out of reach of the traditional theory.  ...  Acknowledgments The first author is supported in part by NSF Award CCF-1813188 and a Guggenheim Fellowship, and performed this work in part while visiting the London School of Economics.  ... 
arXiv:1812.11896v2 fatcat:5q5l34g65jf7beogswtr7nevta

Tight Bounds for the Price of Anarchy of Simultaneous First Price Auctions [article]

George Christodoulou, Annamária Kovács, Alkmini Sgouritsa, Bo Tang
2015 arXiv   pre-print
We study the Price of Anarchy of simultaneous first-price auctions for buyers with submodular and subadditive valuations.  ...  We present an alternative proof of the upper bound of e/(e-1) for first-price auctions with fractionally subadditive valuations which reveals the worst-case price distribution, that is used as a building  ...  We are also grateful to two anonymous reviewers for their useful comments and suggestions about a preliminary version of the paper.  ... 
arXiv:1312.2371v3 fatcat:dn45qkeakbh2te3uzpl4m47rgy

Exact methods for combinatorial auctions

Dries Goossens
2007 4OR  
We settle the computational complexity for all cases considered. In the second part of this thesis, we study the so-called matrix bid auction.  ...  Furthermore, in a combinatorial auction, a buyer is allowed to place bids on subsets of the available items.  ...  We settle the computational complexity for all cases considered. In the second part of this thesis, we study the so-called matrix bid auction.  ... 
doi:10.1007/s10288-007-0035-7 fatcat:veqqwnge4fbqhktzojl5mxnigy

A Survey on Data Pricing: from Economics to Data Science [article]

Jian Pei
2020 arXiv   pre-print
We examine various motivations behind data pricing, understand the economics of data pricing and review the development and evolution of pricing models according to a series of fundamental principles.  ...  How can we assess the value of data objectively, systematically and quantitatively?  ...  Specifically, using a similar idea in combinatorial auctions with single parameter agents [16] , we can relax the truthfulness requirement by requiring being truthful with probability (1 − ), and always  ... 
arXiv:2009.04462v2 fatcat:pacfeqmi7rhdxnihcrnvqbfjay

Policy-based Contracting in Semantic Web Service Markets

Steffen Lamparter
2007
However, achieving a higher degree of automation is obstructed by the informal nature of legal, contractual and organizational regulations, the numerous and complex service descriptions including manifold  ...  The evaluation of the prototype indicates that Web service contracting is applicable in practice and that semantic matching of requests and offers is particularly important for settings with highly customizable  ...  Acknowledgements This work would not have been possible without the support and guidance of many persons. First of all, I would like to thank my advisor Professor Dr.  ... 
doi:10.5445/ir/1000007175 fatcat:cwgh2wlspjghhctyod5ejsrjym

Policy-based Contracting in Semantic Web Service Markets

Steffen Lamparter
2007
However, achieving a higher degree of automation is obstructed by the informal nature of legal, contractual and organizational regulations, the numerous and complex service descriptions including manifold  ...  The evaluation of the prototype indicates that Web service contracting is applicable in practice and that semantic matching of requests and offers is particularly important for settings with highly customizable  ...  Acknowledgements This work would not have been possible without the support and guidance of many persons. First of all, I would like to thank my advisor Professor Dr.  ... 
doi:10.5445/ksp/1000007171 fatcat:v47mj4nqenfw7domrlo62yktjq

Abstracts of Working Papers in Economics

1991 Abstracts of Working Papers in Economics  
Our estimation strategy consists of specifying the wage as a function of firm-specific value added per worker instrumented with the price of imports and the price of exports in the industry.  ...  The paper's main finding is that much of the long-run negative autocorrelation in real exchange rate changes is associated with negative autocorrelation in nominal exchange rate changes.  ...  We examine the set of shortest non-zero integral vectors with respect to the family of norms. We show that the number of such shortest vectors is polynomial in the bit size of A, for fixed n.  ... 
doi:10.1017/s0951007900002497 fatcat:rdh4eij2bbfrjgnmqxjdawyryi

Electronic Markets and Auctions (Dagstuhl Seminar 13461) Computational Models of Language Meaning in Context (Dagstuhl Seminar 13462) Synchronous Programming (Dagstuhl Seminar 13471) Global Measurement Framework (Dagstuhl Seminar 13472) Unleashing Operational Process Mining (Dagstuhl Seminar 13481) Forensic Computing (Dagstuhl Seminar 13482)

Saul Greenberg, Kasper Hornbaek, Aaron Quigley, Harald Reiterer, Roman, Yishay Mansour, Benny Moldovanu, Noam Nisan, Berthold, Hans Kamp, Alessandro Lenci, James (+14 others)
2013 unpublished
Two EC FP7 research projects, Leone and mPlane, kindly supported the social event of the seminar.  ...  The seminar can be seen as a good starting point to identify the role of Proxemics in Human-Computer Interaction.  ...  In particular, we consider two settings: combinatorial auctions with unit demand bidders (bipartite matching) and combinatorial auctions with subadditive bidders.  ... 
fatcat:fl5xhx4dpbeklg6o6xhmuvuety

Synergies, cooperation and syndication in venture capital game, portfolio optimization with genetic algorithms and asset auctions: essays in finance

Vladislav Radak, Technische Universität Dortmund
2021
In chapter 2, we propose a two-stage financing model with three players that consider the output elasticities of all parties using the Cobb-Douglas utility function.  ...  In chapter 5, we use the game theory approach to examine the first-price package auction design for illiquid asset auctions.  ...  FCC VHF Public Coast Auction with 46 assets and 8 bidders Auctions with significantly more assets than bidders present fertile ground for package auctions and development of more complex bidding strategies  ... 
doi:10.17877/de290r-21985 fatcat:3xiqbyjc3ff5ngylue5adj2lq4
« Previous Showing results 1 — 15 out of 16 results