Using Shadow Prices to Reveal Personal Preferences in a Two-Stage Assignment Problem

Anke Thede () and Andreas Geyer-Schulz ()
Additional contact information
Anke Thede: Universität Karlsruhe
Andreas Geyer-Schulz: Universität Karlsruhe

A chapter in Operations Research Proceedings 2006, 2007, pp 245-250 from Springer

Abstract: Abstract Many events such as conferences or informational events at institutions consist of a number of single workshops among which participants can choose a limited number to visit. The workshop assignment problem is a linear optimization problem that finds a feasible assignment of participants to workshops maximizing the social welfare function expressed by preferences of participants for workshops. Several problem constraints reflect the structure and limitations of the event and define possible workshop combinations.

Keywords: Assignment Problem; Shadow Price; Exchange Partner; Linear Optimization Problem; English Auction (search for similar items in EconPapers)
Date: 2007
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-540-69995-8_41

Ordering information: This item can be ordered from
http://www.springer.com/9783540699958

DOI: 10.1007/978-3-540-69995-8_41

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().