10 citations · 15 across the 2 of their papers we have counts for
8 papers · 1 filter
Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics
Rica Gonen, Daniel Lehmann
Finding optimal solutions for multi-unit combinatorial auctions is a hard problem and finding approximations to the optimal solution is also hard. We investigate the use of Branch-…
Generalized Qualitative Probability: Savage revisited
Daniel Lehmann
Preferences among acts are analyzed in the style of L. Savage, but as partially ordered. The rationality postulates considered are weaker than Savage's on three counts. The Sure Th…
Nonstandard numbers for qualitative decision making
Daniel Lehmann
The consideration of nonstandard models of the real numbers and the definition of a qualitative ordering on those models provides a generalization of the principle of maximization…
Classes of service under perfect competition and technological change: a model for the dynamics of the Internet?
Daniel Lehmann
Certain services may be provided in a continuous, one-dimensional, ordered range of different qualities and a customer requiring a service of quality q can only be offered a qualit…
Expected Qualitative Utility Maximization
Daniel Lehmann
A model for decision making that generalizes Expected Utility Maximization is presented. This model, Expected Qualitative Utility Maximization, encompasses the Maximin criterion. I…
Truth Revelation in Approximately Efficient Combinatorial Auctions
Daniel Lehmann, Liadan Ita O'Callaghan, Yoav Shoham
Some important classical mechanisms considered in Microeconomics and Game Theory require the solution of a difficult optimization problem. This is true of mechanisms for combinator…