Martin Andersson and Tuomas Sandholm fmra, Department...  Home/Search
Context Related
| 128.252.165.44/~sa...OCSM.expAAAI99.ps wustl.edu/~sandhol...OCSM.expAAAI99.ps cmu.edu/~sandholm/...OCSM.expAAAI99.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: 128.252.165.44/~sandholm/ (more) From: wustl.edu/~sandholm/index (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The capability to reallocate items---e.g. tasks, securities, bandwidth slices, Mega Watt hours of electricity, and collectibles---is a key feature in automated negotiation. Especially when agents have preferences over combinations of items, this is highly nontrivial. Marginal cost based reallocation leads to an anytime algorithm where every agent's payoff increases monotonically over time. Different contract types head toward different locally optimal allocations of items, and OCSM-contracts... (Update)
Context of citations to this paper: More
...Stop deliberating. Deliberate. Stop deliberating. Reject price. Accept price. b) v v gD Price [1] Bid. 3] Leave auction. [2] Wait. Deliberate if auction will close, with probability 1 (N 1) a (c) Fig. 1. a) Valuation problem. Upper and lower bounds v and v on...
.... research we have applied each of these contracts to a task allocation problem and found the local optima the different protocols reach [1, 2]. In order to improve the achievable social welfare, these contract types can be sequenced 1 The dependencies between tasks in human...
Cited by: More
Computational Criticisms of the Revelation Principle - Conitzer, Sandholm (2003) (Correct)
Making Markets and Democracy Work: A Story of Incentives and.. - Sandholm (2003) (Correct)
Algorithm for Optimal Winner Determination in Combinatorial.. - Sandholm (2002) (Correct)
Similar documents (at the sentence level): More
19.4%: Contract Types for Satisficing Task Allocation: II.. - Andersson, Sandholm (1998) (Correct)
13.3%: Contract Type Sequencing for Reallocative Negotiation - Andersson, Sandholm (2000) (Correct)
12.0%: Washington - University In St (Correct)
Active bibliography (related documents): More All
0.6: Leveled Commitment Contracting among Myopic Individually.. - Andersson, Sandholm (1998) (Correct)
0.5: Robust Combinatorial Auction Protocol against False-name Bids - Yokoo, Sakurai, Matsubara (2000) (Correct)
0.3: Distributed Rational Decision Making - Sandholm (1999) (Correct)
Similar documents based on text: More All
0.1: Contract Types for Satisficing Task Allocation: I Theoretical.. - Sandholm (1998) (Correct)
0.1: Leveled Commitment Contracts with Myopic and Strategic Agents - Andersson, Sandholm (1998) (Correct)
0.1: Curriculum Vitae - Sandholm (Correct)
Related documents from co-citation: More All
5: An implementation of the contract net protocol based on marginal cost calculatio.. - Sandholm - 1993
4: Case study white paper at www (context) - Inc, negotiations et al. - 2003
3: Bidding and allocation in combinatorial auctions - Nisan
BibTeX entry: (Update)
Andersson, M., and Sandholm, T. 1999. Time-Quality tradeoffs in reallocative negotiation with combinatorial contract types. In Proc. 16th National Conf. on Artificial Intelligence (AAAI-99). http://citeseer.ist.psu.edu/85732.html More
@inproceedings{ martin99timequality,
author = "Martin Andersson and Tuomas Sandholm",
title = "Time-Quality Tradeoffs in Reallocative Negotiation with Combinatorial Contract Types",
booktitle = "{AAAI}/{IAAI}",
pages = "3-10",
year = "1999",
url = "citeseer.ist.psu.edu/85732.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
494 The contract net protocol: Highlevel communication and contr.. (context) - Smith - 1980
278 Depth-first iterative-deepening: An optimal admissible tree .. (context) - Korf - 1985
177 An implementation of the contract net protocol based on marg.. - Sandholm - 1993
154 Empirical Methods for Artificial Intelligence (context) - Cohen - 1995
124 The Art and Science of Negotiation (context) - Raiffa - 1982
55 Frontiers of Electronic Commerce (context) - Kalakota, Whinston - 1996
38 Constraint-directed negotiation of resource reallocations (context) - Sathi, Fox - 1989
32 Contract types for satisficing task allocation: I theoretica.. - Sandholm - 1998
26 the gains and losses of speculation in equilibrium markets - Sandholm, Ygge - 1997
24 Leveled commitment contracting among myopic individually rat.. - Andersson, Sandholm
17 Tradeoffs in Contract-Based Distributed Scheduling (context) - Sen - 1993
7 Contract types for satisficing task allocation: II experimen.. - Andersson, Sandholm
4 Sequencing of contract types for anytime task reallocation - Andersson, Sandholm
3 Contract types for optimal task allocation: I theoretical re.. (context) - University, Amherst et al. - 1997
2 and Harstad (context) - Rothkopf, Pekec - 1998
1 Negotiation among SelfInterested Computationally Limited Age.. (context) - AAAI, Sandholm - 1996
1 Harvard Univ (context) - Mass - 1982
1 Rules of Encounter (context) - auction, airport et al. - 1994
1 In Agents-98 Workshop on Agent-Mediated Electronic Trading (context) - on, Electronic et al. - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://128.252.165.44/~sandholm/): More
Coalitions among Computationally Bounded Agents - Sandholm, Lesser (Correct)
eMediator: a Next Generation Electronic Commerce Server - Sandholm (1999) (Correct)
An Algorithm for Optimal Winner Determination in Combinatorial.. - Sandholm (1999) (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