Sciweavers

663 search results - page 26 / 133
» On the Foundations of Expected Expected Utility
Sort
View
ATAL
2008
Springer
14 years 11 months ago
Decommitment in multi-resource negotiation
This paper presents the design and implementation of negotiation agents that negotiate with other entities for acquiring multiple resources. In our approach, agents utilize a time...
Bo An, Victor R. Lesser, Kwang Mong Sim
JIFS
2007
115views more  JIFS 2007»
14 years 9 months ago
Winner determination for combinatorial auctions for tasks with time and precedence constraints
We present a solution to the winner determination problem which takes into account not only costs but also risk aversion of the agent that accepts the bids, and which works for au...
Güleser K. Demir, Maria L. Gini
PST
2004
14 years 11 months ago
Determining Internet Users' Values for Private Information
We examine the problem of determining a user's value for his/her private information. Web businesses often offer rewards, such as discounts, free downloads and website persona...
Scott Buffett, Nathan Scott, Bruce Spencer, Michae...
RTAS
2010
IEEE
14 years 7 months ago
A Stochastic Framework for Multiprocessor Soft Real-Time Scheduling
Prior work has shown that the global earliest-deadline-first (GEDF) scheduling algorithm ensures bounded deadline tardiness on multiprocessors with no utilization loss; therefore...
Alex F. Mills, James H. Anderson
COMPGEOM
1992
ACM
15 years 1 months ago
A Subexponential Bound for Linear Programming
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
Jirí Matousek, Micha Sharir, Emo Welzl