762 research outputs found
Automated Negotiations Under Uncertain Preferences
Automated Negotiation is an emerging field of electronic markets and multi-agent system research. Market engineers are faced in this connection with computational as well as economic issues, such as individual rationality and incentive compatibility. Most literature is focused on autonomous agents and negotiation protocols regarding these issues. However, common protocols show two deficiencies: (1) neglected consideration of agentsā incentives to strive for social welfare, (2) underemphasised acknowledgement that agents build their decision upon preference information delivered by human principals. Since human beings make use of heuristics for preference elicitation, their preferences are subject to informational uncertainty. The contribution of this paper is the proposition of a research agenda that aims at overcoming these research deficiencies. Our research agenda draws theoretically and methodologically on auctions, iterative bargaining, and fuzzy set theory. We complement our agenda with simulation-based preliminary results regarding differences in the application of auctions and iterative bargaining
A theoretical and computational basis for CATNETS
The main content of this report is the identification and definition of market mechanisms for Application Layer Networks (ALNs). On basis of the structured Market Engineering process, the work comprises the identification of requirements which adequate market mechanisms for ALNs have to fulfill. Subsequently, two mechanisms for each, the centralized and the decentralized case are described in this document. These build the theoretical foundation for the work within the following two years of the CATNETS project. --Grid Computing
05011 Abstracts Collection -- Computing and Markets
From 03.01.05 to 07.01.05, the
Dagstuhl Seminar 05011``Computing and Markets\u27\u27 was held
in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
Theoretical and Computational Basis for Economical Ressource Allocation in Application Layer Networks - Annual Report Year 1
This paper identifies and defines suitable market mechanisms for Application Layer Networks (ALNs). On basis of the structured Market Engineering process, the work comprises the identification of requirements which adequate market mechanisms for ALNs have to fulfill. Subsequently, two mechanisms for each, the centralized and the decentralized case are described in this document. --Grid Computing
Theoretical and Computational Basis for CATNETS - Annual Report Year 2
In this work the self-organising potential of the CATNETS allocation mechanism is described to provide a more comprehensive view on the research done in this project. The formal description of either the centralised and decentralised approach is presented. Furthermore the agents' bidding model is described and a comprehensive overview on how the catallactic mechanism is incorporated into the middleware and simulator environments is given. --Decentralized Market Mechanisms,Centralized Market Mechanisms,Catallaxy,Market Engineering,Simulator Integration,Prototype Integration
The Semantic Grid: A future e-Science infrastructure
e-Science offers a promising vision of how computer and communication technology can support and enhance the scientific process. It does this by enabling scientists to generate, analyse, share and discuss their insights, experiments and results in an effective manner. The underlying computer infrastructure that provides these facilities is commonly referred to as the Grid. At this time, there are a number of grid applications being developed and there is a whole raft of computer technologies that provide fragments of the necessary functionality. However there is currently a major gap between these endeavours and the vision of e-Science in which there is a high degree of easy-to-use and seamless automation and in which there are flexible collaborations and computations on a global scale. To bridge this practiceāaspiration divide, this paper presents a research agenda whose aim is to move from the current state of the art in e-Science infrastructure, to the future infrastructure that is needed to support the full richness of the e-Science vision. Here the future e-Science research infrastructure is termed the Semantic Grid (Semantic Grid to Grid is meant to connote a similar relationship to the one that exists between the Semantic Web and the Web). In particular, we present a conceptual architecture for the Semantic Grid. This architecture adopts a service-oriented perspective in which distinct stakeholders in the scientific process, represented as software agents, provide services to one another, under various service level agreements, in various forms of marketplace. We then focus predominantly on the issues concerned with the way that knowledge is acquired and used in such environments since we believe this is the key differentiator between current grid endeavours and those envisioned for the Semantic Grid
Theoretical and Computational Basis for CATNETS - Annual Report Year 3
In this document the developments in defining the computational and theoretical framework for economical resource allocation are described. Accordingly the formal specification of the market mechanisms, bidding strategies of the involved agents and the integration of the market mechanisms into the simulator were refined. --Grid Computing
Mechanism design for distributed task and resource allocation among self-interested agents in virtual organizations
The aggregate power of all resources on the Internet is enormous. The Internet can
be viewed as a massive virtual organization that holds tremendous amounts of information
and resources with different ownerships. However, little is known about how to run this
organization efficiently.
This dissertation studies the problems of distributed task and resource allocation
among self-interested agents in virtual organizations. The developed solutions are not
allocation mechanisms that can be imposed by a centralized designer, but decentralized
interaction mechanisms that provide incentives to self-interested agents to behave
cooperatively. These mechanisms also take computational tractability into consideration
due to the inherent complexity of distributed task and resource allocation problems.
Targeted allocation mechanisms can achieve global task allocation efficiency in a
virtual organization and establish stable resource-sharing communities based on agentsĆĆĀ¢ĆĆĆĆ
own decisions about whether or not to behave cooperatively. This high level goal requires
solving the following problems: synthetic task allocation, decentralized coalition formation
and automated multiparty negotiation. For synthetic task allocation, in which each task needs to be accomplished by a
virtual team composed of self-interested agents from different real organizations, my
approach is to formalize the synthetic task allocation problem as an algorithmic mechanism
design optimization problem. I have developed two approximation mechanisms that I prove
are incentive compatible for a synthetic task allocation problem.
This dissertation also develops a decentralized coalition formation mechanism,
which is based on explicit negotiation among self-interested agents. Each agent makes its
own decisions about whether or not to join a candidate coalition. The resulting coalitions
are stable in the core in terms of coalition rationality. I have applied this mechanism to
form resource sharing coalitions in computational grids and buyer coalitions in electronic
markets.
The developed negotiation mechanism in the decentralized coalition formation
mechanism realizes automated multilateral negotiation among self-interested agents who
have symmetric authority (i.e., no mediator exists and agents are peers).
In combination, the decentralized allocation mechanisms presented in this
dissertation lay a foundation for realizing automated resource management in open and
scalable virtual organizations
Modified bargaining protocols for automated negotiation in open multi-agent systems
Current research in multi-agent systems (MAS) has advanced to the development of open MAS, which are characterized by the heterogeneity of agents, free exit/entry and decentralized control. Conflicts of interest among agents are inevitable, and hence automated negotiation to resolve them is one of the promising solutions. This thesis studies three modifications on alternating-offer bargaining protocols for automated negotiation in open MAS. The long-term goal of this research is to design negotiation protocols which can be easily used by intelligent agents in accommodating their need in resolving their conflicts. In particular, we propose three modifications: allowing non-monotonic offers during the bargaining (non-monotonic-offers bargaining protocol), allowing strategic delay (delay-based bargaining protocol), and allowing strategic ignorance to augment argumentation when the bargaining comprises argumentation (ignorance-based argumentation-based negotiation protocol). Utility theory and decision-theoretic approaches are used in the theoretical analysis part, with an aim to prove the benefit of these three modifications in negotiation among myopic agents under uncertainty. Empirical studies by means of computer simulation are conducted in analyzing the cost and benefit of these modifications. Social agents, who use common human bargaining strategies, are the subjects of the simulation. In general, we assume that agents are bounded rational with various degrees of belief and trust toward their opponents. In particular in the study of the non-monotonic-offers bargaining protocol, we assume that our agents have diminishing surplus. We further assume that our agents have increasing surplus in the study of delay-based bargaining protocol. And in the study of ignorance-based argumentation-based negotiation protocol, we assume that agents may have different knowledge and use different ontologies and reasoning engines. Through theoretical analysis under various settings, we show the benefit of allowing these modifications in terms of agentsā expected surplus. And through simulation, we show the benefit of allowing these modifications in terms of social welfare (total surplus). Several implementation issues are then discussed, and their potential solutions in terms of some additional policies are proposed. Finally, we also suggest some future work which can potentially improve the reliability of these modifications
- ā¦