Agent-based service composition through simultaneous negotiation in forward and reverse auctions

@inproceedings{Preist2003AgentbasedSC,  title={Agent-based service composition through simultaneous negotiation in forward and reverse auctions},  author={Chris Preist and Claudio Bartolini and Andrew Byde},  booktitle={ACM Conference on Economics and Computation},  year={2003},  url={https://api.semanticscholar.org/CorpusID:1868153}}
This paper considers a service composition agent that both buys components and sells services through auctions, and presents algorithms that is able to manage this risk, by appropriately bidding/offering in many auctions and reverse auctions simultaneously.

Figures from this paper

53 Citations

Bidding for customer orders in TAC SCM

This paper considers the problem of finding the set of bids to customers in simultaneous reverse auctions that maximizes the agent's expected profit and compares several machine learning approaches to estimating the probability of bid acceptance and presents a heuristic approach to searching for the optimal set of bidding.

Combining bundle search with buyer coalition formation in electronic markets: a distributed approach through explicit negotiation

A distributed mechanism that allows buyers to use both bundle search and buyer coalition formation, which includes a very efficient heuristic bundle search algorithm and a distributed coalition formation scheme, based on an explicit negotiation protocol.

Enhancement of revenue management strategies through location-aware m-auctions for logistics services

The last two decades have witnessed the successful application of revenue management (RM) strategies in many markets where the trading item is characterised by high perishability, as is the case with…

Decision-theoretic bidding in online-auctions

This paper analyzes existing approaches of tackling the problem of decision making in multiple, heterogeneous auctions and develops a flexible Dynamic Programming-based decision-making framework for agents, participating in multiple auctions.

Strategic agents for multi-resource negotiation

Negotiation agents in this paper are designed to adjust the number of tentative agreements for each resource and the amount of concession they are willing to make in response to changing market conditions and negotiation situations.

A Decision-Theoretic Algorithm for Bundle Purchasing in Multiple Open Ascending-Price Auctions

An algorithm for decision-making where the buyer needs to procure one of possibly many bundles of complementary products, and items are sold individually in multiple open ascending-price auctions is presented.

Considering expected utility of future bidding options in bundle purchasing with multiple auctions

An algorithm for decision-making in multiple open ascending-price (English) auctions where the buyer needs to procure a complete bundle of complementary products and the value iteration method of dynamic programming is used to determine the value of bidding/not bidding in each state.

Combining bundle search with buyer coalition formation in electronic markets: a distributed approach through negotiation

    Linli HeT. Ioerger
    Business, Computer Science
    Proceedings of the Third International Joint…
  • 2004
A distributed mechanism that allows buyers to use both purchasing strategies, which includes a heuristic bundle search algorithm and a distributed coalition formation scheme, which is based on an explicit negotiation protocol with low communication cost.

Towards an Ant System for Autonomous Agents

This paper shows how to build an ant system for autonomous agents that assigns customer agents' services to supplier agents' bids in the best possible way while considering several factors.
...

33 References

Towards Agent-Based Service Composition through Negotiation in Multiple Auctions

This paper discusses the technical issues surrounding the automation of dynamic electronic service composition, using a fictitious company, FreightMixer, to demonstrate the process, and presents the specification of an algorithm to provide a robust solution to these problems in the context of multiple simultaneous auctions.

A Fuzzy-Logic Based Bidding Strategy for Autonomous Agents in Continuous Double Auctions

This paper develops new algorithms that buyer and seller agents can use to participate in continuous double auctions and shows how an agent can dynamically adjust its bidding behavior to respond effectively to changes in the supply and demand in the marketplace.

Algorithm Design for Agents which Participate in Multiple Simultaneous Auctions

A coordination algorithm is presented, which ensures the agent places appropriate bids in the different auctions to buy exactly the right number of goods, and an algorithm to determine what maximum bid an agent should place in an auction that is about to terminate is presented.

Economic dynamics of agents in multiple auctions

This paper presents an agent that is able to participate in multiple auctions for a given good, placing bids appropriately to secure the cheapest price, and shows how the market approaches ideal behaviour when all participants use the agent.

Automated Negotiation in Many-to-Many Markets for Imperfectly Substitutable Goods

The IS-ZIP agent is presented, which is a generalisation of the ZIP agent for double auctions of Cliff and Bruten, and it is demonstrated that, when trading a single good, it is equivalent to Preist and van Tol's modification of the Zip agent.

Autonomous Agents for Participating in Mulitple On-line Auctions

This paper presents the deisgn of an autonomous agent that can alleviate some of the problems of e-consumers by participating across multiple online auctions (in particular, English, Dutch, and Vickrey auctions).

eMediator: A Next Generation Electronic Commerce Server

This paper presents eMediator, an electronic commerce server prototype that demonstrates ways in which algorithmic support and game–theoretic incentive engineering can jointly improve the efficiency…

Possibilistic-Based Design of Bidding Strategies in Electronic Auctions

This paper proposes a two-fold method for decision making that does not require the evaluation of the whole set of alternati ve ac- tions and utilizes global (market-centered) in formation in a first step to come up with an initial set of potential bids.

Strategic sequential bidding in auctions using dynamic programming

A general framework in which real-time Dynamic Programming (DP) can be used to formulate agent bidding strategies in a broad class of auctions characterized by sequential bidding and continuous clearing, and suggests that this algorithm may offer the best performance of any published CDA bidding strategy.

BiddingBot: a multiagent support system for cooperative bidding in multiple auctions

BiddingBot is proposed which is a multi agent system that supports users in attending, monitoring, and bidding in multiple auctions, and uses a new cooperative bidding mechanism to effectively bid in auctions.

Related Papers

Showing 1 through 3 of 0 Related Papers