@article{11670,
  abstract     = {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.},
  author       = {Dütting, Paul and Henzinger, Monika H and Weber, Ingmar},
  issn         = {2167-8383},
  journal      = {ACM Transactions on Economics and Computation},
  keywords     = {Computational Mathematics, Marketing, Economics and Econometrics, Statistics and Probability, Computer Science (miscellaneous)},
  number       = {1},
  publisher    = {Association for Computing Machinery},
  title        = {{An expressive mechanism for auctions on the web}},
  doi          = {10.1145/2716312},
  volume       = {4},
  year         = {2015},
}

@article{8459,
  abstract     = {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.},
  author       = {Morin, Sébastien and Linnet, Troels E and Lescanne, Mathilde and Schanda, Paul and Thompson, Gary S and Tollinger, Martin and Teilum, Kaare and Gagné, Stéphane and Marion, Dominique and Griesinger, Christian and Blackledge, Martin and d’Auvergne, Edward J},
  issn         = {1367-4803},
  journal      = {Bioinformatics},
  keywords     = {Statistics and Probability, Computational Theory and Mathematics, Biochemistry, Molecular Biology, Computational Mathematics, Computer Science Applications},
  number       = {15},
  pages        = {2219--2220},
  publisher    = {Oxford University Press},
  title        = {{Relax: The analysis of biomolecular kinetics and thermodynamics using NMR relaxation dispersion data}},
  doi          = {10.1093/bioinformatics/btu166},
  volume       = {30},
  year         = {2014},
}

@article{8526,
  author       = {Kaloshin, Vadim},
  issn         = {0003-486X},
  journal      = {The Annals of Mathematics},
  keywords     = {Statistics, Probability and Uncertainty, Statistics and Probability},
  number       = {2},
  pages        = {729--741},
  publisher    = {JSTOR},
  title        = {{An extension of the Artin-Mazur theorem}},
  doi          = {10.2307/121093},
  volume       = {150},
  year         = {1999},
}