Sciweavers

SIGECOM
2004
ACM
96views ECommerce» more  SIGECOM 2004»
13 years 10 months ago
A stochastic programming approach to scheduling in TAC SCM
In this paper, we combine two approaches to handling uncertainty: we use techniques for finding optimal solutions in the expected sense to solve combinatorial optimization proble...
Michael Benisch, Amy R. Greenwald, Victor Narodits...
SIGECOM
2004
ACM
86views ECommerce» more  SIGECOM 2004»
13 years 10 months ago
Mechanisms for a spatially distributed market
We consider the problem of a spatially distributed market with strategic agents. A single good is traded in a set of independent markets, where shipment between markets is possibl...
Moshe Babaioff, Noam Nisan, Elan Pavlov
SIGECOM
2004
ACM
97views ECommerce» more  SIGECOM 2004»
13 years 10 months ago
Collaboration of untrusting peers with changing interests
Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Ma...
SIGECOM
2004
ACM
120views ECommerce» more  SIGECOM 2004»
13 years 10 months ago
Computational criticisms of the revelation principle
The revelation principle is a cornerstone tool in mechanism design. It states that one can restrict attention, without loss in the designer’s objective, to mechanisms in which A...
Vincent Conitzer, Tuomas Sandholm
SIGECOM
2004
ACM
112views ECommerce» more  SIGECOM 2004»
13 years 10 months ago
Self-interested automated mechanism design and implications for optimal combinatorial auctions
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...
Vincent Conitzer, Tuomas Sandholm
SIGECOM
2004
ACM
96views ECommerce» more  SIGECOM 2004»
13 years 10 months ago
Expressive negotiation over donations to charities
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as negotiating material to induce other parties interested in the charity to dona...
Vincent Conitzer, Tuomas Sandholm