scientific article; zbMATH DE number 5938925
zbMATH Open1235.60137MaRDI QIDQ5199896FDOQ5199896
Authors: Kumiko Hattori, Tetsuya Hattori
Publication date: 16 August 2011
Title of this publication is not available (Why is that?)
Recommendations
- The approximability of assortment optimization under ranking preferences
- scientific article; zbMATH DE number 7042525
- scientific article; zbMATH DE number 2080233
- Fast Approximation Methods for Sales Force Deployment
- Approximation algorithms for the selling with preference
- Economical Caching with Stochastic Prices
- An equilibrium search model of synchronized sales
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- Approximation algorithm and incentive ratio of the selling with preference
dependent random variablesBurgers equationlaw of large numbershydrodynamic limitsearch costmove-to-front ruleranking processlong tail economy
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Searching and sorting (68P10) PDEs in connection with fluid mechanics (35Q35) Solutions to PDEs in closed form (35C05) Interacting particle systems in time-dependent statistical mechanics (82C22) Fundamental topics (basic mathematics, methodology; applicable to economics in general) (91B02)
Cited In (4)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199896)