Auction protocols for decentralized scheduling
From MaRDI portal
Decentralized scheduling is the problem of allocating resources to alternative possible uses over time, where competing uses are represented by autonomous agents. Market mechanisms use prices derived through distributing bidding protocols to determine schedules. The authors investigate the existence of equilibrium prices for some general classes of scheduling problems, the quality of equilibrium solutions, and the behavior of an ascending auction mechanism and bidding protocol. To remedy the potential nonexistence of price equilibria due to complementarities in preference they introduce additional markets in combinations of basis goods. Finally, they consider direct revelation mechanisms and compare to the market-based approach.
Recommendations
- On auction protocols for decentralized scheduling
- A Combinatorial Auction Framework for Solving Decentralized Scheduling Problems (Extended Abstract)
- scientific article; zbMATH DE number 1966909
- Efficient (re-)scheduling: an auction approach
- A market-based multi-agent system model for decentralized multi-project scheduling
Cites work
- A new and improved design for multiobject iterative auctions
- A parametrization of the auction design space
- Assignment Problems and the Location of Economic Activities
- Auction algorithms for network flow problems: A tutorial introduction
- Competitive equilibrium in an exchange economy with indivisibilities
- Computationally manageable combinational auctions
- Efficient mechanisms for bilateral trading
- scientific article; zbMATH DE number 3650233 (Why is no real title available?)
- scientific article; zbMATH DE number 1149401 (Why is no real title available?)
- scientific article; zbMATH DE number 1373581 (Why is no real title available?)
- Incentives in Teams
- Job Matching, Coalition Formation, and Gross Substitutes
- Microeconomic theory
- The assignment game. I: The core
- The competitive allocation process is informationally efficient uniquely
- Walrasian equilibrium with gross substitutes
Cited in
(40)- Promoting cooperation in selfish computational grids
- Decentralized computation procurement and computational robustness in a smart market
- A market-based mechanism for allocating space shuttle secondary payload priority
- Tractable combinatorial auctions and \(b\)-matching
- Decentralised scheduling with confidentiality protection
- Price of fairness in two-agent single-machine scheduling problems
- Approximation and collusion in multicast cost sharing
- Bundling equilibrium in combinatorial auctions
- Efficient (re-)scheduling: an auction approach
- A BGP-based mechanism for lowest-cost routing
- The price of fairness for a two-agent scheduling game minimizing total completion time
- Scheduling two agent task chains with a central selection mechanism
- Look-ahead strategies for dynamic pickup and delivery problems
- Trading grid services - a multi-attribute combinatorial approach
- A market-based multi-agent system model for decentralized multi-project scheduling
- Combinatorial auctions
- Combinatorial auctions for electronic business
- Distributed scheduling: a review of concepts and applications
- Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling
- Parallel Auction Algorithm for Bus Rescheduling
- scientific article; zbMATH DE number 1966909 (Why is no real title available?)
- scientific article; zbMATH DE number 1981035 (Why is no real title available?)
- scientific article; zbMATH DE number 2038828 (Why is no real title available?)
- scientific article; zbMATH DE number 2087946 (Why is no real title available?)
- Auction-based distributed scheduling and control scheme for flexible manufacturing systems
- Group preference modeling for intelligent shared environments: social welfare beyond the sum
- Randomized mechanism design for decentralized network scheduling
- A Combinatorial Auction Framework for Solving Decentralized Scheduling Problems (Extended Abstract)
- A multi‐agent system for the decentralized resource‐constrained multi‐project scheduling problem
- Distributed project scheduling with information sharing in supply chains: part I—an agent-based negotiation model
- On auction protocols for decentralized scheduling
- Algorithmic mechanism design
- Scheduling with package auctions
- Modelling and analysis of a network organization for cooperation of manufacturers on production capacity
- A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods
- Analyzing the price of fairness in scheduling problems with two agents
- Multiparty quantum English auction scheme using single photons as message carrier
- Experimental internet auctions with random information retrieval
- Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems
- Decentralized subcontractor scheduling with divisible jobs
This page was built for publication: Auction protocols for decentralized scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5938627)
