Sciweavers

98 search results - page 3 / 20
» On the hardness of pricing loss-leaders
Sort
View
EOR
2006
134views more  EOR 2006»
13 years 7 months ago
A smoothing heuristic for a bilevel pricing problem
In this paper, we provide a heuristic procedure, that performs well from a global optimality point of view, for an important and difficult class of bilevel programs. The algorithm...
Jean-Pierre Dussault, Patrice Marcotte, Séb...
FSTTCS
2010
Springer
13 years 5 months ago
Combinatorial Problems with Discounted Price Functions in Multi-agent Systems
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...
Gagan Goel, Pushkar Tripathi, Lei Wang
AAAI
2012
11 years 9 months ago
The Price of Neutrality for the Ranked Pairs Method
The complexity of the winner determination problem has been studied for almost all common voting rules. A notable exception, possibly caused by some confusion regarding its exact ...
Markus Brill, Felix A. Fischer
ISIPTA
2003
IEEE
102views Mathematics» more  ISIPTA 2003»
14 years 21 days ago
A Sensitivity Analysis for the Pricing of European Call Options in a Binary Tree Model
The European call option prices have well-known formulae in the Cox-RossRubinstein model [2], depending on the volatility of the underlying asset. Nevertheless it is hard to give ...
Huguette Reynaerts, Michèle Vanmaele
ICC
2007
IEEE
117views Communications» more  ICC 2007»
14 years 1 months ago
Price Negotiation Systems for M-commerce
— As content delivery to wireless devices becomes faster and scalable, it is likely that mobile commerce will constitute a significant portion of digital commerce. In markets, b...
Huafei Zhu, Feng Bao, A. Lakshminarayanan