Sciweavers

220 search results - page 20 / 44
» Real options valuation
Sort
View
WINE
2009
Springer
182views Economy» more  WINE 2009»
14 years 3 months ago
Competitive Repeated Allocation without Payments
We study the problem of allocating a single item repeatedly among multiple competing agents, in an environment where monetary transfers are not possible. We design (Bayes-Nash) inc...
Mingyu Guo, Vincent Conitzer, Daniel M. Reeves
HPDC
2007
IEEE
14 years 2 months ago
Precise and realistic utility functions for user-centric performance analysis of schedulers
Utility functions can be used to represent the value users attach to job completion as a function of turnaround time. Most previous scheduling research used simple synthetic repre...
Cynthia Bailey Lee, Allan Snavely
ATAL
2007
Springer
14 years 2 months ago
A computational characterization of multiagent games with fallacious rewards
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
Ariel D. Procaccia, Jeffrey S. Rosenschein
SIGECOM
2000
ACM
155views ECommerce» more  SIGECOM 2000»
14 years 29 days ago
Competitive bundling of categorized information goods
We introduce an information bundling model that addresses two important but relatively unstudied issues in real markets for information goods: automated customization of content b...
Jeffrey O. Kephart, Scott A. Fay
AAAI
2008
13 years 11 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings