(Enter summary)
Abstract: Combinatorial auctions provide a valuable mechanism
for the allocation of goods in settings where
buyer valuations exhibit complex structure with respect
to substitutability and complementarity. Most
algorithms are designed to work with explicit "flat"
bids for concrete bundles of goods. However, logical
bidding languages allow the expression of complex
utility functions in a natural and concise way,
and have recently attracted considerable attention. (Update)
Context of citations to this paper: More
...et al. CGNS98, CKP00] They construct a myopically optimal elicitation policy for a rational decision problem. Recently, Boutilier [Bou02] presented an interesting computational study of a POMDP model to construct offline approximations to sequentially optimal preference...
Cited by: More
TBBL: A Tree-Based Bidding Language for Iterative.. - Ruggiero Cavallo David
(Correct)
Five AI Challenges in Strategyproof Computing - David Parkes Division (2003)
(Correct)
Making Markets and Democracy Work: A Story of Incentives and.. - Sandholm (2003)
(Correct)
Similar documents (at the sentence level):
5.1%: Bidding Languages for Combinatorial Auctions - Boutilier, Hoos (2001)
(Correct)
Active bibliography (related documents): More All
0.2: Truth Revelation in Approximately Efficient.. - Lehmann, O'Callaghan.. (1999)
(Correct)
0.1: Exchange Market for Complex Commodities: Search for Optimal.. - Fink, Gong, Johnson
(Correct)
0.1: Achieving Economic and Computational Efficiency - Parkes
(Correct)
Similar documents based on text: More All
0.5: Solving Combinatorial Auctions using Stochastic Local Search - Hoos, Boutilier (2000)
(Correct)
0.3: Bundle Design in Robust Combinatorial Auction Protocol.. - Yokoo, Sakurai.. (2001)
(Correct)
0.3: Integer Programming for Combinatorial Auction Winner.. - Andersson, Tenhunen, Ygge (2000)
(Correct)
Related documents from co-citation: More All
4: Case study white paper at www (context) - Inc, negotiations et al. - 2003
3: Bidding Languages for Combinatorial Auctions
- Boutilier, Hoos - 2001
3: Bidding and allocation in combinatorial auctions
- Nisan
BibTeX entry: (Update)
Craig Boutilier. Solving concisely expressed combinatorial auction problems. In Proc. 18th National Conference on Artificial Intelligence (AAAI-02), July 2002. to appear. http://citeseer.ist.psu.edu/boutilier02solving.html More
@misc{ boutilier02solving,
author = "C. Boutilier",
title = "Solving concisely expressed combinatorial auction problems",
text = "Craig Boutilier. Solving concisely expressed combinatorial auction problems.
In Proc. 18th National Conference on Artificial Intelligence (AAAI-02),
July 2002. to appear.",
year = "2002",
url = "citeseer.ist.psu.edu/boutilier02solving.html" }
Citations (may not include all citations):
184
An algorithm for optimal winner determination in combinatori..
- Sandholm - 1999
184
Computationally manageable combinatorial auctions
- Rothkopf, Pekec et al. - 1998
147
Taming the computational complexity of combinatorial auction.. (context) - Fujisima, Leyton-Brown et al. - 1999
128
Bidding and allocations in combinatorial auctions
- Nisan - 2000
87
Computationally feasible VCG mechanisms
- Nisan, Ronen - 2000
78
Auction protocols for decentralized scheduling
- Wellman, Walsh et al. - 2001
76
CABOB: A fast optimal algorithm for combinatorial auctions
- Sandholm, Suri et al. - 2001
63
Integer programming for combinatorial auction winner determi..
- Andersson, Tenhunen et al. - 2000
63
A combinatorial auction mechanism for airport time slot allo.. (context) - Rassenti, Smith et al. - 1982
51
eMediator: a next generation electronic commerce server
- Sandholm - 2000
29
Bidding languages for combinatorial auctions
- Boutilier, Hoos - 2001
28
Solvingcombinatorial auctions using stochastic local search
- Hoos, Boutilier - 2000
28
OptimizationMethods for Logical Inference (context) - Chandru, Hooker - 1999
27
Towards a universal test suite for combinatorial auction alg..
- Leyton-Brown, Pearson et al. - 2000
12
The exponentiated subgradient algorithm for heuristic boolea..
- Schuurmans, Southey et al. - 2001
7
Mechanism design for resource bounded agents (context) - Kfir-Dahav, Monderer et al. - 2000
Documents on the same site (http://www.cs.toronto.edu/~cebly/papers.html): More
A Unified Model of Qualitative Belief Change: A Dynamical.. - Boutilier (1998)
(Correct)
Abduction as Belief Revision - Boutilier, Becher (1995)
(Correct)
Planning Under Uncertainty: Structural Assumptions and.. - Boutilier, Dean, Hanks (1996)
(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