Hostname: page-component-848d4c4894-ttngx Total loading time: 0 Render date: 2024-05-02T17:07:45.816Z Has data issue: false hasContentIssue false
  • English
  • Français

A brokered market with heterogeneous suppliers and consumers

Part of: Computer system organization Operations research and management science

Published online by Cambridge University Press:  14 July 2016

Rhonda Righter
Rhonda Righter*
Affiliation:
Santa Clara University
*
∗Postal address: Department of Operations and Management Information Systems, Santa Clara University, Santa Clara, CA 95053, USA. Email address: RRighter@mailer.scu.edu.
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider a brokered market with heterogeneous suppliers and consumers of identical items or services. Each supplier determines a minimum acceptable price for the items it supplies, based on its costs and target rate of return. The broker begins with a fixed set of items from the suppliers. Customers arrive periodically to the market and offer a bid for an item. If a customer wants more than one item, a set of bids is made. If the broker accepts a bid it must be assigned an item with minimum accceptable price less than or equal to the bid, and the price paid is the bid price. The broker has the option of rejecting a bid. The broker makes acceptance and assignment decisions to maximize the total expected discounted revenue. We show the optimal policy has a simple threshold structure where thresholds can be easily determined by finding the individually optimal policies subject to priorities.

Keywords

Sequential assignmentstochastic dynamic programmingefficient marketsheterogeneous markets

MSC classification

Primary: 90B35: Scheduling theory, deterministic
Secondary: 68M20: Performance evaluation; queueing; scheduling
Type
Research Papers
Information
Journal of Applied Probability , Volume 36 , Issue 2 , June 1999 , pp. 512 - 522
Copyright
Copyright © Applied Probability Trust 1999 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Albright, S. C. (1974). Optimal sequential assignments with random arrival times. Management Sci. 21, 60–67.CrossRefGoogle Scholar
Albright, S. C. (1977). A Bayesian approach to a generalized house selling problem. Management Sci. 24, 432–440.CrossRefGoogle Scholar
David, I. (1995). A sequential assignment match process with general renewal arrival times. Prob. Eng. Inf. Sci. 9, 475–492.Google Scholar
David, I., and Yechiali, U. (1995). One-attribute sequential assignment match processes in discrete time. Operat. Res. 43, 879–884.CrossRefGoogle Scholar
Derman, C., Lieberman, G., and Ross, S. (1972). A sequential stochastic assignment problem. Management Sci. 18, 349–355.CrossRefGoogle Scholar
Kennedy, D. P. (1986). Optimal sequential assignment. Math. Operat. Res. 11, 619–626.Google Scholar
Nakai, T. (1986). A sequential stochastic assignment problem in a stationary Markov chain. Math. Japonica 31, 741–757.Google Scholar
Nakai, T. (1986). A sequential stochastic assignment problem in a partially observable Markov chain. Math. Operat. Res. 11, 230–240.Google Scholar
Papastavrou, J. D., Rajagopalan, S., and Kleywegt, A. J. (1996). The dynamic and stochastic knapsack problem with deadlines. Management Sci. 42, 1706–1718.Google Scholar
Righter, R. L. (1987). The stochastic sequential assignment problem with random deadlines. Prob. Eng. Inf. Sci. 1, 189–202.Google Scholar
Righter, R. L. (1989). A resource allocation problem in a random environment. Operat. Res. 37, 329–338.Google Scholar
Saario, V., and Sakaguchi, M. (1990). Some generalized house-selling problems. Math. Japonica 35, 861–873.Google Scholar