Filters








18,634 Hits in 5.4 sec

Optimal Bidding Strategies and Equilibria in Dynamic Auctions with Budget Constraints

Ramakrishna Gummadi, Peter Key, Alexandre Proutiere
2012 Social Science Research Network  
We first provide a structural characterization of the associated value function and the optimal bidding strategy, which specifies the extent to which agents underbid from their true valuation due to long  ...  Second, the total bidder population is often large, which means it is unrealistic to assume that the bidders could possibly optimize their strategy by modeling specific opponents.  ...  ACKNOWLEDGMENTS The first author would like to thank Michael Padilla for his careful reading and feedback on the online budgeting problem.  ... 
doi:10.2139/ssrn.2066175 fatcat:yudkyhi2l5heni7xacfuranspy

An Adaptive Population Size Differential Evolution with Novel Mutation Strategy for Constrained Optimization [article]

Yuan Fu, Hu Wang, Meng-Zhu Yang
2018 arXiv   pre-print
Differential evolution (DE) has competitive performance on constrained optimization problems (COPs), which targets at searching for global optimal solution without violating the constraints.  ...  The proposed differential evolution algorithm, APDE-NS, is evaluated on the benchmark problems from CEC2017 constrained real parameter optimization.  ...  . 2) A simple framework for constrained problems with application of L-SHADE44 and IDE (L-SHADE44+IDE) [34] . 3) L-SHADE with competing strategies applied to constrained optimization (L-SHADE44) [35]  ... 
arXiv:1805.04217v1 fatcat:wr7fbgbetze6zpt4y2h6vn3b6q

Intrinsic Scene Decomposition from RGB-D Images

Mohammed Hachama, Bernard Ghanem, Peter Wonka
2015 2015 IEEE International Conference on Computer Vision (ICCV)  
Unlike most previous approaches, especially Retinex-like techniques, these terms do not depend on the image gradient or texture, thus reducing the mixing shading/reflectance artifacts and leading to better  ...  The obtained non-linear optimization problem is efficiently solved using a cyclic block coordinate descent algorithm.  ...  Acknowledgement Research reported in this publication was supported by competitive research funding from King Abdullah University of Science and Technology (KAUST) with grant number OCRF-2014-CRG3-62140401  ... 
doi:10.1109/iccv.2015.99 dblp:conf/iccv/HachamaGW15 fatcat:7myqhgpmjndbdm45bjf2yyiqp4

Hybrid Stochastic Ranking for Constrained Optimization

Muhammad Asif Jan, Muhammad Sagheer, Hidayat Ullah Khan, Muhammad Irfan Uddin, Rashida Adeeb Khanum, Marwan Mahmoud, Ikramullah, Noor Mast
2020 IEEE Access  
In [29] , L-SHADE is enhanced with adaptive ε-constraint handling technique to introduce the constrained algorithm, CAL-SHADE.  ...  In L-SHADE44+IDE, L-SHADE44 and IDE competed for trial vector's selection. In [33] , L-SHADE44+IDE is combined with ε-constraint handling technique to form constrained variant of L-SHADE44+IDE.  ...  He loves to work with diverse and multidisciplinary research teams. MUHAMMAD IRFAN UDDIN  ... 
doi:10.1109/access.2020.3044439 fatcat:uru3h5wjibeohftvxb2y2bt4dy

Evolutionary Framework with Reinforcement Learning-based Mutation Adaptation

Karam M. Sallam, Saber M. Elsayed, Ripon K. Chakraborrty, Michael J. Ryan
2020 IEEE Access  
algorithm with novel mutation with elites regeneration (ERG-EFADE) [83] ; • Improved L-SHADE algorithm (iL-SHADE) [25] ; • L-SHADE with Competing Strategies (LSHADE44) [84] ; • Multi-population ensemble  ...  It was applied to an ant colony optimization algorithm to improve its learning efficiency. To control the mutation strategies of DE, Sharma et al.  ... 
doi:10.1109/access.2020.3033593 fatcat:ugv37nye7naypeytb3q3zwdkla

Numerical shape-from-shading revisited

Hiroaki Santo, Masaki Samejima, Yasuyuki Matsushita
2018 IPSJ Transactions on Computer Vision and Applications  
This paper instead studies relaxation strategies for the original non-convex constraint and describes corresponding solution techniques that are built upon advanced convex optimization.  ...  The original problem is non-convex due to the unit norm constraint for surface normal, and the existing approaches including the original Ikeuchi and Horn's work uses approximate solution strategies for  ...  Publisher's Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.  ... 
doi:10.1186/s41074-018-0044-9 fatcat:4ut4phvrqjgazh3rsk2tepocu4

Bayesian optimization with known experimental and design constraints for chemistry applications [article]

Riley J. Hickman, Matteo Aldeghi, Florian Häse, Alán Aspuru-Guzik
2022 arXiv   pre-print
The tools developed constitute a simple, yet versatile strategy to enable model-based optimization with known experimental constraints, contributing to its applicability as a core component of autonomous  ...  Optimization strategies driven by machine learning, such as Bayesian optimization, are being explored across experimental sciences as an efficient alternative to traditional design of experiment.  ...  Constrained optimization benchmarks on analytical functions with continuous parameters. The upper row shows contour plots of the surfaces with constrained regions darkly shaded.  ... 
arXiv:2203.17241v1 fatcat:jckponspmfbzzc74otk6o6u2ty

Real-time shading-based refinement for consumer depth cameras

Chenglei Wu, Michael Zollhöfer, Matthias Nießner, Marc Stamminger, Shahram Izadi, Christian Theobalt
2014 ACM Transactions on Graphics  
From left: Example input depth and RGB image; raw depth input prior to refinement (rendered with normals and phong shading, respectively); our refined result, note detail on the eye (top right) compared  ...  To enable this type of real-time depth map enhancement, we contribute a new highly parallel algorithm that reformulates the inverse rendering optimization problem in prior work, allowing us to estimate  ...  We would also like to thank Angela Dai for the video voice over.  ... 
doi:10.1145/2661229.2661232 fatcat:d7ix3rgmj5gldabgi23gfcfqji

Research Note—Strategic Bid-Shading and Sequential Auctioning with Learning from Past Prices

Robert Zeithammer
2007 Management science  
Such learning depends on the extent of bid-shading because the seller needs to invert the bidding strategy to learn.  ...  Unlike in exogenous sequences of auctions, the optimal bidding strategy thus depends on the seller's selling strategy.  ...  to the aggregate supply arising from the selling strategies of competing sellers.  ... 
doi:10.1287/mnsc.1070.0691 fatcat:2b4r52jjbnbpll2ux22ndhop3e

An Efficient Deep Distribution Network for Bid Shading in First-Price Auctions [article]

Tian Zhou, Hao He, Shengjun Pan, Niklas Karlsson, Bharatbhushan Shetty, Brendan Kitts, Djordje Gligorijevic, San Gultekin, Tingyu Mao, Junwei Pan, Jianlong Zhang, Aaron Flores
2021 arXiv   pre-print
Due to the fundamental difference between these auctions, demand-side platforms (DSPs) have had to update their bidding strategies to avoid bidding unnecessarily high and hence overpaying.  ...  Bid shading was proposed to adjust the bid price intended for second-price auctions, in order to balance cost and winning probability in a first-price auction setup.  ...  If the competing bidders' prices were known in advance, which is impossible in practice, the optimal bidding strategy would be to submit a bid price that is slightly higher than the highest competing bid  ... 
arXiv:2107.06650v1 fatcat:nj7eaepo3fajritgqzihf4ifai

Financing a Portfolio of Projects

Roman Inderst, Holger M. Mueller, Felix Münnich
2006 The Review of financial studies  
Section 2 examines the benefits and costs of constrained finance with respect to effort incentives. Section 3 considers the optimal choice between constrained and unconstrained finance.  ...  higher than that of competing portfolio projects.  ...  Indeed, if there is an epsilon cost, they will strictly prefer not to apply. 13 Leaving the decision rights with regard to the refinancing decision with the investor is optimal given our fly-by-night  ... 
doi:10.1093/rfs/hhl038 fatcat:jfkn4gxwbrd7nmvvb2ljyraf44

Hierarchical Collaborated Fireworks Algorithm

Yifeng Li, Ying Tan
2022 Electronics  
The effectiveness of proposed strategy is demonstrated on the benchmark test suite from CEC 2020.  ...  The fireworks algorithm (FWA) has achieved significant global optimization ability by organizing multiple simultaneous local searches.  ...  Although it remains tough to compete with some state-of-art implementations of DE such as [17, 39] on this benchmark, HCFWA achieves better results on problems with a large number of local optimal, such  ... 
doi:10.3390/electronics11060948 fatcat:tozchptd25fctdi5a7nebtso24

Dense scattering layer removal

Qiong Yan, Li Xu, Jiaya Jia
2013 SIGGRAPH Asia 2013 Technical Briefs on - SA '13  
A selective-neighbor criterion is presented to convert the unconventional constrained optimization problem to an unconstrained one where the latter can be efficiently solved.  ...  Abstract We propose a new model, together with advanced optimization, to separate a thick scattering media layer from a single natural image.  ...  Our method applied to images taken in fog, sandstorm, and underwater scenes.  ... 
doi:10.1145/2542355.2542373 dblp:conf/siggraph/YanXJ13 fatcat:hksa2fmtorfq3h7g3fneom7amm

Externalities in a Capacity Auction

Martin Ranger
2006 Social Science Research Network  
The modification of Ausubel & Milgrom (2002)'s generalized ascending proxy auction developed in Ranger (2004) is shown to lead to an efficient allocation.  ...  This paper examines a Cournot game where capacity constraints are determined in an auction prior to the market interaction.  ...  A particularly simple strategy is for a firm i to require the proxy to demand at least a profit target π n by shading the maximum bids uniformly.  ... 
doi:10.2139/ssrn.834804 fatcat:wqdx7nkwg5bi7dpb422cuzw6ja

Breadth versus depth: Interactions that stabilize particle assemblies to changes in density or temperature

William D. Piñeros, Michael Baldea, Thomas M. Truskett
2016 Journal of Chemical Physics  
This allows us to efficiently find optimized interactions for a wide range of possible chemical potential constraints.  ...  We use inverse methods of statistical mechanics to explore trade-offs associated with designing interactions to stabilize self-assembled structures against changes in density or temperature.  ...  Avni Jain about the ground-state calculations in this work, as well as her help with comparing our results to those obtained from earlier simulated annealing approaches to inverse design.  ... 
doi:10.1063/1.4942117 pmid:26931707 fatcat:xldgbx7edba2dp34lmtvqjywxu
« Previous Showing results 1 — 15 out of 18,634 results