Author image not provided
 Marek Adamczyk

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article7.00
Citation Count14
Publication count2
Publication years2011-2015
Available for download0
Average downloads per article0.00
Downloads (cumulative)0
Downloads (12 Months)0
Downloads (6 Weeks)0
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author




BOOKMARK & SHARE


3 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 3 of 3
Sort by:

1 published by ACM
December 2017 ACM Transactions on Economics and Computation (TEAC) - Special Issue on Wine'15: Volume 5 Issue 4, December 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 6,   Downloads (12 Months): 6,   Downloads (Overall): 6

Full text available: PDFPDF
We study the revenue performance of sequential posted-price mechanisms and some natural extensions for a setting where the valuations of the buyers are drawn from a correlated distribution. Sequential posted-price mechanisms are conceptually simple mechanisms that work by proposing a “take-it-or-leave-it” offer to each buyer. We apply sequential posted-price mechanisms ...
Keywords: Mechanism design, posted pricing, approximation, correlated values, interdependence

2
December 2015 WINE 2015: Proceedings of the 11th International Conference on Web and Internet Economics - Volume 9470
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 2

We study the revenue performance of sequential posted price mechanisms and some natural extensions, for a general setting where the valuations of the buyers are drawn from a correlated distribution. Sequential posted price mechanisms are conceptually simple mechanisms that work by proposing a "take-it-or-leave-it" offer to each buyer. We apply ...

3
August 2011 Information Processing Letters: Volume 111 Issue 15, August, 2011
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 9

The stochastic matching problem with applications in online dating and kidney exchange was introduced by Chen et al. (2009) [1] together with a simple greedy strategy. They proved it is a 4-approximation, but conjectured that the greedy algorithm is in fact a 2-approximation. In this paper we confirm this hypothesis.
Keywords: Approximation algorithms, Analysis of algorithms, Stochastic optimization



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us