An auction-based method for decentralized train scheduling

Proceedings of the International Conference on Autonomous Agents

Volumn , Issue , 2001, Pages 43-50

  Parkes, D C ^a   Ungar, L H ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; OPTIMIZATION; SOFTWARE AGENTS;

AUCTION-BASED METHODS;

DECENTRALIZED CONTROL;

EID: 0034826809     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/375735.375866     Document Type: Conference Paper

References (12)

1. Integer programming for auctions with bids for combinations
2. Sequential auctions for the allocation of resources with complementarities
3. A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of the right to use railroad tracks
4. Mutually destructive bidding: The FCC auction design problem
5. Real-time scheduling of freight railroads
6. Optimal pacing of trains in freight railroads: Model formulation and solution
7. The TUFF train scheduler- trip scheduling on single-track networks
8. Bidding and allocation in combinatorial auctions
9. iBundle: An efficient ascending price bundle auction
10. A combinatorial mechanism for airport time slot allocation
11. Auction protocols for decentralized scheduling