Queuing May Be First-Best Efficient
No abstract is available for this item.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||1995|
|Date of revision:|
|Contact details of provider:|| Postal: THEMA, Universite de Paris X-Nanterre, U.F.R. de science economiques, gestion, mathematiques et informatique, 200, avenue de la Republique 92001 Nanterre CEDEX.|
When requesting a correction, please mention this item's handle: RePEc:fth:pnegmi:9520. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.