Sciweavers

1380 search results - page 62 / 276
» Computing the optimal strategy to commit to
Sort
View
DALT
2008
Springer
13 years 9 months ago
Abstracting and Verifying Strategy-Proofness for Auction Mechanisms
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
Emmanuel M. Tadjouddine, Frank Guerin, Wamberto We...
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
13 years 11 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
ICC
2007
IEEE
14 years 2 months ago
Optimizing Power Allocation and Matching of Cooperative Diversity Systems
— In this paper, we study how to appropriately match users for two-user cooperative diversity systems that deploy optimal power allocation for an amplify and forward or a regener...
Veluppillai Mahinthan, Lin Cai, Jon W. Mark, Xuemi...
CSCLP
2007
Springer
14 years 1 months ago
A Comparison of the Notions of Optimality in Soft Constraints and Graphical Games
The notion of optimality naturally arises in many areas of applied mathematics and computer science concerned with decision making. Here we consider this notion in the context of ...
Krzysztof R. Apt, Francesca Rossi, Kristen Brent V...

Publication
325views
15 years 5 months ago
An Optimal Multi-Unit Combinatorial Procurement Auction with Single Minded Bidders
Abstract: The current art in optimal combinatorial auctions is limited to handling the case of single units of multiple items, with each bidder bidding on exactly one bundle (singl...
Sujit Guajr, Y Narahari