ترغب بنشر مسار تعليمي؟ اضغط هنا

Negotiating over Bundles and Prices Using Aggregate Knowledge

275   0   0.0 ( 0 )
 نشر من قبل Tomas Klos
 تاريخ النشر 2004
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

Combining two or more items and selling them as one good, a practice called bundling, can be a very effective strategy for reducing the costs of producing, marketing, and selling goods. In this paper, we consider a form of multi-issue negotiation where a shop negotiates both the contents and the price of bundles of goods with his customers. We present some key insights about, as well as a technique for, locating mutually beneficial alternatives to the bundle currently under negotiation. The essence of our approach lies in combining historical sales data, condensed into aggregate knowledge, with current data about the ongoing negotiation process, to exploit these insights. In particular, when negotiating a given bundle of goods with a customer, the shop analyzes the sequence of the customers offers to determine the progress in the negotiation process. In addition, it uses aggregate knowledge concerning customers valuations of goods in general. We show how the shop can use these two sources of data to locate promising alternatives to the current bundle. When the current negotiations progress slows down, the shop may suggest the most promising of those alternatives and, depending on the customers response, continue negotiating about the alternative bundle, or propose another alternative. Extensive computer simulation experiments show that our approach increases the speed with which deals are reached, as well as the number and quality of the deals reached, as compared to a benchmark. In addition, we show that the performance of our system is robust to a variety of changes in the negotiation strategies employed by the customers.



قيم البحث

اقرأ أيضاً

In this paper, we consider a form of multi-issue negotiation where a shop negotiates both the contents and the price of bundles of goods with his customers. We present some key insights about, as well as a procedure for, locating mutually beneficial alternatives to the bundle currently under negotiation. The essence of our approach lies in combining aggregate (anonymous) knowledge of customer preferences with current data about the ongoing negotiation process. The developed procedure either works with already obtained aggregate knowledge or, in the absence of such knowledge, learns the relevant information online. We conduct computer experiments with simulated customers that have_nonlinear_ preferences. We show how, for various types of customers, with distinct negotiation heuristics, our procedure (with and without the necessary aggregate knowledge) increases the speed with which deals are reached, as well as the number and the Pareto efficiency of the deals reached compared to a benchmark.
Multi-agent coverage control is used as a mechanism to influence the behavior of a group of robots by introducing time-varying domain. The coverage optimization problem is modified to adopt time-varying domains, and the proposed control law possesses an exponential convergence characteristic. Cumbrous control for many robots is simplified by deploying distribution and behavior of the robot team as a whole. In the proposed approach, the inputs to the multi-agent system, i.e., time-varying density and time-varying domain, are agnostic to the size of the system. Analytic expressions of surface and line integrals present in the control law are obtained under uniform density. The scalability of the proposed control strategy is explained and verified via numerical simulation. Experiments on real robots are used to test the proposed control law.
This paper discusses the dynamics of Transaction Cost (TC) in Industrial Symbiosis Institutions (ISI) and provides a fair and stable mechanism for TC allocation among the involved firms in a given ISI. In principle, industrial symbiosis, as an implem entation of the circular economy paradigm in the context of industrial relation, is a practice aiming at reducing the material/energy footprint of the firm. The well-engineered form of this practice is proved to decrease the transaction costs at a collective level. This can be achieved using information systems for: identifying potential synergies, evaluating mutually beneficial ones, implementing the contracts, and governing the behavior of the established relations. Then the question is how to distribute the costs for maintaining such an information system in a fair and stable manner? We see such a cost as a collective transaction cost and employ an integrated method rooted in cooperative game theory and multiagent systems research to develop a fair and stable allocation mechanism for it. The novelty is twofold: in developing analytical multiagent methods for capturing the dynamics of transaction costs in industrial symbiosis and in presenting a novel game-theoretic mechanism for its allocation in industrial symbiosis institutions. While the former contributes to the theories of industrial symbiosis (methodological contribution), the latter supports decision makers aiming to specify fair and stable industrial symbiosis contracts (practical contribution).
In this paper we introduce a qualitative decision and game theory based on belief (B) and desire (D) rules. We show that a group of agents acts as if it is maximizing achieved joint goals.
We study online resource allocation in a cloud computing platform, through a posted pricing mechanism: The cloud provider publishes a unit price for each resource type, which may vary over time; upon arrival at the cloud system, a cloud user either t akes the current prices, renting resources to execute its job, or refuses the prices without running its job there. We design pricing functions based on the current resource utilization ratios, in a wide array of demand-supply relationships and resource occupation durations, and prove worst-case competitive ratios of the pricing functions in terms of social welfare. In the basic case of a single-type, non-recycled resource (i.e., allocated resources are not later released for reuse), we prove that our pricing function design is optimal, in that any other pricing function can only lead to a worse competitive ratio. Insights obtained from the basic cases are then used to generalize the pricing functions to more realistic cloud systems with multiple types of resources, where a job occupies allocated resources for a number of time slots till completion, upon which time the resources are returned back to the cloud resource pool.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا