Sciweavers

227 search results - page 37 / 46
» Combinatorial Auctions with Budgets
Sort
View
AIR
2004
111views more  AIR 2004»
14 years 10 months ago
Towards Fast Vickrey Pricing using Constraint Programming
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...
Alan Holland, Barry O'Sullivan
EVOW
2007
Springer
15 years 4 months ago
A Hybrid Method for Solving Large-Scale Supply Chain Problems
Abstract. The strategic supply chain design problem which allows capacity shifts and budget limitations can be formulated as a linear program. Since facilities are allowed to be op...
Steffen Wolf, Peter Merz
STACS
2007
Springer
15 years 4 months ago
Cost Sharing Methods for Makespan and Completion Time Scheduling
Abstract. Roughgarden and Sundararajan recently introduced an alternative measure of efficiency for cost sharing mechanisms. We study cost sharing methods for combinatorial optimiz...
Janina A. Brenner, Guido Schäfer
CORR
2010
Springer
229views Education» more  CORR 2010»
14 years 8 months ago
Market Equilibrium with Transaction Costs
Identical products being sold at different prices in different locations is a common phenomenon. To model such scenarios, we supplement the classical Fisher market model by intro...
Sourav Chakraborty, Nikhil R. Devanur, Chinmay Kar...
ALDT
2009
Springer
172views Algorithms» more  ALDT 2009»
15 years 4 months ago
On Multi-dimensional Envy-Free Mechanisms
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
Ahuva Mu'alem