Computer Science Department University of Massachusetts at Amherst July 1994...  Home/Search
Context
Related
| umass.edu/pub/techr...UMCS1994054.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~sandholm/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents a method for automatically deriving a time- and contentdependent information value function for probabilistic information. This function describes analytically what real world value an agent can obtain by using a certain piece of information at a certain time. The general form of this function is formulated and a specific example with two-valued outputs is presented in the factory scheduling domain. (Update)
Active bibliography (related documents): More All
0.1: Coalition Formation among Bounded Rational Agents - Sandholm, Lesser (1995) (Correct)
0.1: Issues in Automated Negotiation and Electronic Commerce.. - Sandholm, Lesser (1995) (Correct)
0.1: Coalitions among Computationally Bounded Agents - Sandholm, Lesser (Correct)
Similar documents based on text: More All
0.9: Advantages of a Leveled Commitment Contracting Protocol - Sandholm, Lesser (1995) (Correct)
0.8: An Exchange Protocol without Enforcement - Sandholm, Lesser (1994) (Correct)
0.8: Equilibrium Analysis of the Possibilities of Unenforced.. - Sandholm, Lesser (1995) (Correct)
BibTeX entry: (Update)
@misc{ department-tuomas,
author = "Computer Science Department",
title = "Tuomas W. Sandholm and Victor R. Lesser",
url = "citeseer.ist.psu.edu/675995.html" }
Citations (may not include all citations):1364 A robust layered control system for a mobile robot (context) - Brooks - 1986 ACM
402 An analysis of time-dependent planning (context) - Dean, Boddy - 1988 DBLP
329 Where the Really Hard Problems Are - Cheeseman, Kanefsky et al. - 1991 DBLP
320 Hard and Easy Distributions of SAT Problems - Mitchell, Selman et al. - 1992 DBLP
219 and Complexity Classes (context) - Papadimitriou, Yannakakis - 1991
189 Solving time-dependent planning problems (context) - Boddy, Dean - 1989 ACM DBLP
134 Experimental Results on the Crossover Point in Satisfiabilit.. - Crawford, Auton - 1993 DBLP
113 The Breakout Method For Escaping From Local Minima (context) - Morris - 1993 DBLP
95 Principles of metareasoning - Russell, Wefald - 1991 ACM DBLP
93 Reasoning about Beliefs and Actions under Computational Reso.. - Horvitz - 1989 DBLP
83 Design-to-time real-time scheduling - Garvey, Lesser - 1993 ACM
81 Operational rationality through compilation of anytime algor.. - Zilberstein - 1993 ACM DBLP
57 Approximate Processing in Real-Time Problem Solving (context) - Lesser, Pavlin et al. - 1989 ACM DBLP
38 A Survey of Research in Deliberative Real-Time Artificial In.. - Garvey, Lesser - 1994 ACM DBLP
25 Decision analysis and behavioral research (context) - von Winterfeldt, Edwards - 1986
17 Extending Deep Structure (context) - Williams, Hogg - 1993 DBLP
15 Information Value Theory (context) - Howard - 1966
12 Utility-Based Termination of Anytime Algorithms (context) - Sandholm, Lesser - 1994
1 A New Order Parameter for 3SAT (context) - Sandholm - 1994
Documents on the same site (http://www-2.cs.cmu.edu/~sandholm/): More
Miscomputing Ratio: The Social Cost of Selfish Computing - Larson, Sandholm (2003) (Correct)
Complexity of Determining Nonemptiness of the Core - Conitzer, Sandholm (2002) (Correct)
Definition and Complexity of Some Basic Metareasoning Problems - Conitzer, Sandholm (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC