You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
How can organizations ensure that they can get best value for money in their procurement decisions? How can they stimulate innovations from their dedicated suppliers? With contributions from leading academics and professionals, this 2006 handbook offers expert guidance on the fundamental aspects of successful procurement design and management in firms, public administrations, and international institutions. The issues addressed include the management of dynamic procurement; the handling of procurement risk; the architecture of purchasing systems; the structure of incentives in procurement contracts; methods to increase suppliers' participation in procurement contests and e-procurement platforms; how to minimize the risk of collusion and of corruption; pricing and reputation mechanisms in e-procurement platforms; and how procurement can enhance innovation. Inspired by frontier research, it provides practical recommendations to managers, engineers and lawyers engaged in private and public procurement design.
Proceedings held May 1989. Topics include temporal logic, hierarchical knowledge bases, default theories, nonmonotonic and analogical reasoning, formal theories of belief revision, and metareasoning. Annotation copyright Book News, Inc. Portland, Or.
Computational pool is a relatively recent entrant into the group of games played by computer agents. It features a novel combination of properties that distinguish it from other such games, including continuous action and state spaces, uncertainty in execution, a unique turn-taking structure, and of course an adversarial nature. This combination leads to new challenges, both in modeling and reasoning about the game and in designing agents for effective play. We address the modeling challenges by presenting a model of generalized billiards games and showing that an equilibrium exists within this model. To address the practical challenges of designing an agent, we discuss CueCard, our agent wh...
An international team of experts covers the pros and cons of different auction formats and lessons learned in the field.
To select the most suitable simulation algorithm for a given task is often difficult. This is due to intricate interactions between model features, implementation details, and runtime environment, which may strongly affect the overall performance. An automated selection of simulation algorithms supports users in setting up simulation experiments without demanding expert knowledge on simulation. Roland Ewald analyzes and discusses existing approaches to solve the algorithm selection problem in the context of simulation. He introduces a framework for automatic simulation algorithm selection and describes its integration into the open-source modelling and simulation framework James II. Its selection mechanisms are able to cope with three situations: no prior knowledge is available, the impact of problem features on simulator performance is unknown, and a relationship between problem features and algorithm performance can be established empirically. The author concludes with an experimental evaluation of the developed methods.
A Symposium was held on February 25, 2006 in honor of the 80th birthday of Saul I. Gass and his major contributions to the field of operations research over 50 years. This volume includes articles from each of the Symposium speakers plus 16 other articles from friends, colleagues, and former students. Each contributor offers a forward-looking perspective on the future development of the field.
This textbook connects three vibrant areas at the interface between economics and computer science: algorithmic game theory, computational social choice, and fair division. It thus offers an interdisciplinary treatment of collective decision making from an economic and computational perspective. Part I introduces to algorithmic game theory, focusing on both noncooperative and cooperative game theory. Part II introduces to computational social choice, focusing on both preference aggregation (voting) and judgment aggregation. Part III introduces to fair division, focusing on the division of both a single divisible resource ("cake-cutting") and multiple indivisible and unshareable resources ("multiagent resource allocation"). In all these parts, much weight is given to the algorithmic and complexity-theoretic aspects of problems arising in these areas, and the interconnections between the three parts are of central interest.
The Fourth International Conference on Signal-Image Technology & Internet-Based S- tems (SITIS 2008) has been successfully held during the period 30th November to 3rd of December of the year 2008 in Bali, Indonesia. The Track Web-Based Information Te- nologies & Distributed Systems (WITDS) is one of the four tracks of the conference. The track is devoted to emerging and novel concepts, architectures and methodologies for c- ating an interconnected world in which information can be exchanged easily, tasks can be processed collaboratively, and communities of users with similar interests can be formed while addressing security threats that are present more than ever before. The track has attrac...
None