---
_id: '11670'
abstract:
- lang: eng
  text: Auctions are widely used on the Web. Applications range from sponsored search
    to platforms such as eBay. In these and in many other applications the auctions
    in use are single-/multi-item auctions with unit demand. The main drawback of
    standard mechanisms for this type of auctions, such as VCG and GSP, is the limited
    expressiveness that they offer to the bidders. The General Auction Mechanism (GAM)
    of Aggarwal et al. [2009] takes a first step toward addressing the problem of
    limited expressiveness by computing a bidder optimal, envy-free outcome for linear
    utility functions with identical slopes and a single discontinuity per bidder-item
    pair. We show that in many practical situations this does not suffice to adequately
    model the preferences of the bidders, and we overcome this problem by presenting
    the first mechanism for piecewise linear utility functions with nonidentical slopes
    and multiple discontinuities. Our mechanism runs in polynomial time. Like GAM
    it is incentive compatible for inputs that fulfill a certain nondegeneracy assumption,
    but our requirement is more general than the requirement of GAM. For discontinuous
    utility functions that are nondegenerate as well as for continuous utility functions
    the outcome of our mechanism is a competitive equilibrium. We also show how our
    mechanism can be used to compute approximately bidder optimal, envy-free outcomes
    for a general class of continuous utility functions via piecewise linear approximation.
    Finally, we prove hardness results for even more expressive settings.
acknowledgement: We would like to thank Veronika Loitzenbauer and the anonymous referees
  for their valuable feedback.
article_number: '1'
article_processing_charge: No
article_type: original
author:
- first_name: Paul
  full_name: Dütting, Paul
  last_name: Dütting
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
- first_name: Ingmar
  full_name: Weber, Ingmar
  last_name: Weber
citation:
  ama: Dütting P, Henzinger MH, Weber I. An expressive mechanism for auctions on the
    web. <i>ACM Transactions on Economics and Computation</i>. 2015;4(1). doi:<a href="https://doi.org/10.1145/2716312">10.1145/2716312</a>
  apa: Dütting, P., Henzinger, M. H., &#38; Weber, I. (2015). An expressive mechanism
    for auctions on the web. <i>ACM Transactions on Economics and Computation</i>.
    Association for Computing Machinery. <a href="https://doi.org/10.1145/2716312">https://doi.org/10.1145/2716312</a>
  chicago: Dütting, Paul, Monika H Henzinger, and Ingmar Weber. “An Expressive Mechanism
    for Auctions on the Web.” <i>ACM Transactions on Economics and Computation</i>.
    Association for Computing Machinery, 2015. <a href="https://doi.org/10.1145/2716312">https://doi.org/10.1145/2716312</a>.
  ieee: P. Dütting, M. H. Henzinger, and I. Weber, “An expressive mechanism for auctions
    on the web,” <i>ACM Transactions on Economics and Computation</i>, vol. 4, no.
    1. Association for Computing Machinery, 2015.
  ista: Dütting P, Henzinger MH, Weber I. 2015. An expressive mechanism for auctions
    on the web. ACM Transactions on Economics and Computation. 4(1), 1.
  mla: Dütting, Paul, et al. “An Expressive Mechanism for Auctions on the Web.” <i>ACM
    Transactions on Economics and Computation</i>, vol. 4, no. 1, 1, Association for
    Computing Machinery, 2015, doi:<a href="https://doi.org/10.1145/2716312">10.1145/2716312</a>.
  short: P. Dütting, M.H. Henzinger, I. Weber, ACM Transactions on Economics and Computation
    4 (2015).
date_created: 2022-07-27T12:43:18Z
date_published: 2015-12-02T00:00:00Z
date_updated: 2023-02-09T10:08:41Z
day: '02'
doi: 10.1145/2716312
extern: '1'
intvolume: '         4'
issue: '1'
keyword:
- Computational Mathematics
- Marketing
- Economics and Econometrics
- Statistics and Probability
- Computer Science (miscellaneous)
language:
- iso: eng
month: '12'
oa_version: None
publication: ACM Transactions on Economics and Computation
publication_identifier:
  eissn:
  - 2167-8383
  issn:
  - 2167-8375
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: An expressive mechanism for auctions on the web
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2015'
...
---
_id: '8459'
abstract:
- lang: eng
  text: Nuclear magnetic resonance (NMR) is a powerful tool for observing the motion
    of biomolecules at the atomic level. One technique, the analysis of relaxation
    dispersion phenomenon, is highly suited for studying the kinetics and thermodynamics
    of biological processes. Built on top of the relax computational environment for
    NMR dynamics is a new dispersion analysis designed to be comprehensive, accurate
    and easy-to-use. The software supports more models, both numeric and analytic,
    than current solutions. An automated protocol, available for scripting and driving
    the graphical user interface (GUI), is designed to simplify the analysis of dispersion
    data for NMR spectroscopists. Decreases in optimization time are granted by parallelization
    for running on computer clusters and by skipping an initial grid search by using
    parameters from one solution as the starting point for another —using analytic
    model results for the numeric models, taking advantage of model nesting, and using
    averaged non-clustered results for the clustered analysis.
article_processing_charge: No
article_type: original
author:
- first_name: Sébastien
  full_name: Morin, Sébastien
  last_name: Morin
- first_name: Troels E
  full_name: Linnet, Troels E
  last_name: Linnet
- first_name: Mathilde
  full_name: Lescanne, Mathilde
  last_name: Lescanne
- first_name: Paul
  full_name: Schanda, Paul
  id: 7B541462-FAF6-11E9-A490-E8DFE5697425
  last_name: Schanda
  orcid: 0000-0002-9350-7606
- first_name: Gary S
  full_name: Thompson, Gary S
  last_name: Thompson
- first_name: Martin
  full_name: Tollinger, Martin
  last_name: Tollinger
- first_name: Kaare
  full_name: Teilum, Kaare
  last_name: Teilum
- first_name: Stéphane
  full_name: Gagné, Stéphane
  last_name: Gagné
- first_name: Dominique
  full_name: Marion, Dominique
  last_name: Marion
- first_name: Christian
  full_name: Griesinger, Christian
  last_name: Griesinger
- first_name: Martin
  full_name: Blackledge, Martin
  last_name: Blackledge
- first_name: Edward J
  full_name: d’Auvergne, Edward J
  last_name: d’Auvergne
citation:
  ama: 'Morin S, Linnet TE, Lescanne M, et al. Relax: The analysis of biomolecular
    kinetics and thermodynamics using NMR relaxation dispersion data. <i>Bioinformatics</i>.
    2014;30(15):2219-2220. doi:<a href="https://doi.org/10.1093/bioinformatics/btu166">10.1093/bioinformatics/btu166</a>'
  apa: 'Morin, S., Linnet, T. E., Lescanne, M., Schanda, P., Thompson, G. S., Tollinger,
    M., … d’Auvergne, E. J. (2014). Relax: The analysis of biomolecular kinetics and
    thermodynamics using NMR relaxation dispersion data. <i>Bioinformatics</i>. Oxford
    University Press. <a href="https://doi.org/10.1093/bioinformatics/btu166">https://doi.org/10.1093/bioinformatics/btu166</a>'
  chicago: 'Morin, Sébastien, Troels E Linnet, Mathilde Lescanne, Paul Schanda, Gary
    S Thompson, Martin Tollinger, Kaare Teilum, et al. “Relax: The Analysis of Biomolecular
    Kinetics and Thermodynamics Using NMR Relaxation Dispersion Data.” <i>Bioinformatics</i>.
    Oxford University Press, 2014. <a href="https://doi.org/10.1093/bioinformatics/btu166">https://doi.org/10.1093/bioinformatics/btu166</a>.'
  ieee: 'S. Morin <i>et al.</i>, “Relax: The analysis of biomolecular kinetics and
    thermodynamics using NMR relaxation dispersion data,” <i>Bioinformatics</i>, vol.
    30, no. 15. Oxford University Press, pp. 2219–2220, 2014.'
  ista: 'Morin S, Linnet TE, Lescanne M, Schanda P, Thompson GS, Tollinger M, Teilum
    K, Gagné S, Marion D, Griesinger C, Blackledge M, d’Auvergne EJ. 2014. Relax:
    The analysis of biomolecular kinetics and thermodynamics using NMR relaxation
    dispersion data. Bioinformatics. 30(15), 2219–2220.'
  mla: 'Morin, Sébastien, et al. “Relax: The Analysis of Biomolecular Kinetics and
    Thermodynamics Using NMR Relaxation Dispersion Data.” <i>Bioinformatics</i>, vol.
    30, no. 15, Oxford University Press, 2014, pp. 2219–20, doi:<a href="https://doi.org/10.1093/bioinformatics/btu166">10.1093/bioinformatics/btu166</a>.'
  short: S. Morin, T.E. Linnet, M. Lescanne, P. Schanda, G.S. Thompson, M. Tollinger,
    K. Teilum, S. Gagné, D. Marion, C. Griesinger, M. Blackledge, E.J. d’Auvergne,
    Bioinformatics 30 (2014) 2219–2220.
date_created: 2020-09-18T10:08:07Z
date_published: 2014-08-01T00:00:00Z
date_updated: 2021-01-12T08:19:25Z
day: '01'
doi: 10.1093/bioinformatics/btu166
extern: '1'
intvolume: '        30'
issue: '15'
keyword:
- Statistics and Probability
- Computational Theory and Mathematics
- Biochemistry
- Molecular Biology
- Computational Mathematics
- Computer Science Applications
language:
- iso: eng
month: '08'
oa_version: None
page: 2219-2220
publication: Bioinformatics
publication_identifier:
  issn:
  - 1367-4803
  - 1460-2059
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
related_material:
  link:
  - relation: erratum
    url: https://doi.org/10.1093/bioinformatics/btz397
status: public
title: 'Relax: The analysis of biomolecular kinetics and thermodynamics using NMR
  relaxation dispersion data'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 30
year: '2014'
...
---
_id: '8526'
article_processing_charge: No
article_type: original
author:
- first_name: Vadim
  full_name: Kaloshin, Vadim
  id: FE553552-CDE8-11E9-B324-C0EBE5697425
  last_name: Kaloshin
  orcid: 0000-0002-6051-2628
citation:
  ama: Kaloshin V. An extension of the Artin-Mazur theorem. <i>The Annals of Mathematics</i>.
    1999;150(2):729-741. doi:<a href="https://doi.org/10.2307/121093">10.2307/121093</a>
  apa: Kaloshin, V. (1999). An extension of the Artin-Mazur theorem. <i>The Annals
    of Mathematics</i>. JSTOR. <a href="https://doi.org/10.2307/121093">https://doi.org/10.2307/121093</a>
  chicago: Kaloshin, Vadim. “An Extension of the Artin-Mazur Theorem.” <i>The Annals
    of Mathematics</i>. JSTOR, 1999. <a href="https://doi.org/10.2307/121093">https://doi.org/10.2307/121093</a>.
  ieee: V. Kaloshin, “An extension of the Artin-Mazur theorem,” <i>The Annals of Mathematics</i>,
    vol. 150, no. 2. JSTOR, pp. 729–741, 1999.
  ista: Kaloshin V. 1999. An extension of the Artin-Mazur theorem. The Annals of Mathematics.
    150(2), 729–741.
  mla: Kaloshin, Vadim. “An Extension of the Artin-Mazur Theorem.” <i>The Annals of
    Mathematics</i>, vol. 150, no. 2, JSTOR, 1999, pp. 729–41, doi:<a href="https://doi.org/10.2307/121093">10.2307/121093</a>.
  short: V. Kaloshin, The Annals of Mathematics 150 (1999) 729–741.
date_created: 2020-09-18T10:50:28Z
date_published: 1999-09-01T00:00:00Z
date_updated: 2021-01-12T08:19:53Z
day: '01'
doi: 10.2307/121093
extern: '1'
intvolume: '       150'
issue: '2'
keyword:
- Statistics
- Probability and Uncertainty
- Statistics and Probability
language:
- iso: eng
month: '09'
oa_version: None
page: 729-741
publication: The Annals of Mathematics
publication_identifier:
  issn:
  - 0003-486X
publication_status: published
publisher: JSTOR
quality_controlled: '1'
status: public
title: An extension of the Artin-Mazur theorem
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 150
year: '1999'
...