Sciweavers

227 search results - page 36 / 46
» Combinatorial Auctions with Budgets
Sort
View
MIDDLEWARE
2007
Springer
15 years 4 months ago
Fair access to scarce resources in ad-hoc grids using an economic-based approach
In ad-hoc Grids where the availability of resources and tasks changes over the time, distributing the tasks among the scarce resources in a balanced way is a challenging task. In ...
Behnaz Pourebrahimi, Koen Bertels
119
Voted
SIGECOM
2011
ACM
256views ECommerce» more  SIGECOM 2011»
14 years 28 days ago
Competitive equilibrium in two sided matching markets with general utility functions
In this paper, we study the class of competitive equilibria in two sided matching markets with general (non-quasilinear) utility functions. Mechanism design in general non-quasili...
Saeed Alaei, Kamal Jain, Azarakhsh Malekian
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
15 years 3 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
SIGECOM
2004
ACM
132views ECommerce» more  SIGECOM 2004»
15 years 3 months ago
A dynamic pari-mutuel market for hedging, wagering, and information aggregation
I develop a new mechanism for risk allocation and information speculation called a dynamic pari-mutuel market (DPM). A DPM acts as hybrid between a pari-mutuel market and a contin...
David M. Pennock
CPAIOR
2011
Springer
14 years 1 months ago
Upgrading Shortest Paths in Networks
We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to ...
Bistra N. Dilkina, Katherine J. Lai, Carla P. Gome...