Results 1  10
of
212
CABOB: A fast optimal algorithm for combinatorial auctions
"... Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners iscomplete and inapproximable. We present CABOB, a sophisticated search algorithm for the problem. It uses decomposition techniques, upper and lower bounding (also a ..."
Abstract

Cited by 122 (26 self)
 Add to MetaCart
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners iscomplete and inapproximable. We present CABOB, a sophisticated search algorithm for the problem. It uses decomposition techniques, upper and lower bounding (also across components), elaborate and dynamically chosen bid ordering heuristics, and a host of structural observations. Experiments against CPLEX 7.0 show that CABOB is usually faster, never drastically slower, and in many cases drastically faster. We also uncover interesting aspects of the problem itself. First, the problems with short bids that were hard for the firstgeneration of specialized algorithms are easy. Second, almost all of the CATS distributions are easy, and become easier with more bids. Third, we test a number of random restart strategies, and show that they do not help on this problem because the runtime distribution does not have a heavy tail (at least not for CABOB). 1
A Linear Programming Formulation for Global Inference in Natural Language Tasks
 In Proceedings of CoNLL2004
, 2004
"... The typical processing paradigm in natural language processing is the "pipeline" approach, where learners are being used at one level, their outcomes are being used as features for a second level of predictions and so one. In addition to accumulating errors, it is clear that the sequential processin ..."
Abstract

Cited by 116 (32 self)
 Add to MetaCart
The typical processing paradigm in natural language processing is the "pipeline" approach, where learners are being used at one level, their outcomes are being used as features for a second level of predictions and so one. In addition to accumulating errors, it is clear that the sequential processing is a crude approximation to a process in which interactions occur across levels and down stream decisions often interact with previous decisions. This work develops a general...
LeaderFollower Strategies for Robotic Patrolling in Environments with Arbitrary Topologies
"... Game theoretic approaches to patrolling have become a topic of increasing interest in the very last years. They mainly refer to a patrolling mobile robot that preserves an environment from intrusions. These approaches allow for the development of patrolling strategies that consider the possible acti ..."
Abstract

Cited by 53 (1 self)
 Add to MetaCart
Game theoretic approaches to patrolling have become a topic of increasing interest in the very last years. They mainly refer to a patrolling mobile robot that preserves an environment from intrusions. These approaches allow for the development of patrolling strategies that consider the possible actions of the intruder in deciding where the robot should move. Usually, it is supposed that the intruder can hide and observe the actions of the patroller before intervening. This leads to the adoption of a leaderfollower solution concept. In this paper, mostly theoretical in its nature, we propose an approach to determine optimal leaderfollower strategies for a mobile robot patrolling an environment. Differently from previous works in literature, our approach can be applied to environments with arbitrary topologies.
CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
, 2005
"... Combinatorial auctions where bidders can bid on bundles of items can lead to more economically efficient allocations, but determining the winners is NPcomplete and inapproximable. We present CABOB, a sophisticated optimal search algorithm for the problem. It uses decomposition techniques, upper and ..."
Abstract

Cited by 49 (9 self)
 Add to MetaCart
Combinatorial auctions where bidders can bid on bundles of items can lead to more economically efficient allocations, but determining the winners is NPcomplete and inapproximable. We present CABOB, a sophisticated optimal search algorithm for the problem. It uses decomposition techniques, upper and lower bounding (also across components), elaborate and dynamically chosen bidordering heuristics, and a host of structural observations. CABOB attempts to capture structure in any instance without making assumptions about the instance distribution. Experiments against the fastest prior algorithm, CPLEX 8.0, show that CABOB is often faster, seldom drastically slower, and in many cases drastically faster—especially in cases with structure. CABOB’s search runs in linear space and has significantly better anytime performance than CPLEX. We also uncover interesting aspects of the problem itself. First, problems with short bids, which were hard for the first generation of specialized algorithms, are easy. Second, almost all of the CATS distributions are easy, and the run time is virtually unaffected by the number of goods. Third, we test several random restart strategies, showing that they do not help on this problem—the runtime distribution does not have a heavy tail.
Deadlock Avoidance in Sequential Resource Allocation Systems with Multiple Resource Acquisitions and Flexible Routings
 IEEE Transactions on Automatic Control
, 2000
"... This paper considers the deadlock avoidance problem for the class of conjunctive / disjunctive (sequential) resource allocation systems (C/DRAS), which allows for multiple resource acquisitions and flexible routings. First, a new siphonbased characterization for the liveness of Petri nets (PN's) m ..."
Abstract

Cited by 46 (18 self)
 Add to MetaCart
This paper considers the deadlock avoidance problem for the class of conjunctive / disjunctive (sequential) resource allocation systems (C/DRAS), which allows for multiple resource acquisitions and flexible routings. First, a new siphonbased characterization for the liveness of Petri nets (PN's) modeling C/DRAS is developed, and subsequently, this characterization facilitates the development of a polynomialcomplexity deadlock avoidance policy (DAP) that is appropriate for the considered RAS class. The resulting policy is characterized as C/DRUN, since the starting point for the policy development was motivated by the RUN DAP, originally developed for sequential RAS with unit resource allocations and no routing flexibility. The last part of the paper exploits the aforementioned siphonbased characterization of C/DRAS liveness, in order to develop a su#ciency condition for C/DRAS liveness that takes the convenient form of a Mixed Integer Programming (MIP) formulation. The availabil...
On the Use of Integer Programming Models in AI Planning
 In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
, 1999
"... Recent research has shown the promise of using propositional reasoning and search to solve AI planning problems. In this paper, we further explore this area by applying Integer Programming to solve AI planning problems. The application of Integer Programming to AI planning has a potentially si ..."
Abstract

Cited by 45 (1 self)
 Add to MetaCart
Recent research has shown the promise of using propositional reasoning and search to solve AI planning problems. In this paper, we further explore this area by applying Integer Programming to solve AI planning problems. The application of Integer Programming to AI planning has a potentially significant advantage, as it allows quite naturally for the incorporation of numerical constraints and objectives into the planning domain. Moreover, the application of Integer Programming to AI planning addresses one of the challenges in propositional reasoning posed by Kautz and Selman, who conjectured that the principal technique used to solve Integer Programsthe linear programming (LP) relaxationis not useful when applied to propositional search. We discuss various IP formulations for the class of planning problems based on STRIPSstyle planning operators. Our main objective is to show that a carefully chosen IP formulation significantly improves the "strength" of the LP relaxation, and that the resultant LPs are useful in solving the IP and the associated planning problems. Our results clearly show the importance of choosing the "right" representation, and more generally the promise of using Integer Programming techniques in the AI planning domain. 1
The sample average approximation method applied to stochastic routing problems: a computational study
 Computational Optimization and Applications
"... Abstract. The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. ..."
Abstract

Cited by 44 (7 self)
 Add to MetaCart
Abstract. The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps. We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and firststage integer variables. For each of the three problem classes, we use decomposition and branchandcut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 21694 scenarios to within an estimated 1.0 % of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably nearoptimal solutions to these difficult stochastic programs using only a moderate amount of computation time. Keywords: salesman stochastic optimization, stochastic programming, stochastic routing, shortest path, traveling 1.
Playing games for security: An efficient exact algorithm for solving bayesian stackelberg games
 In AAMAS
, 2008
"... In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adversary chooses its own strategy. We consider Bayesian Stackelberg games, in which the leader is uncertain about the types ..."
Abstract

Cited by 43 (15 self)
 Add to MetaCart
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adversary chooses its own strategy. We consider Bayesian Stackelberg games, in which the leader is uncertain about the types of adversary it may face. Such games are important in security domains, where, for example, a security agent (leader) must commit to a strategy of patrolling certain areas, and a robber (follower) has a chance to observe this strategy over time before choosing its own strategy of where to attack. This paper presents an efficient exact algorithm for finding the optimal strategy for the leader to commit to in these games. This algorithm, DOBSS, is based on a novel and compact mixedinteger linear programming formulation. Compared to the most efficient algorithm known previously for this problem, DOBSS is not only faster, but also leads to higher quality solutions, and does not suffer from problems of infeasibility that were faced by this previous algorithm. Note that DOBSS is at the heart of the ARMOR system that is currently being tested for security scheduling at the Los Angeles International Airport.
Implementing the DantzigFulkersonJohnson Algorithm for Large Traveling Salesman Problems
, 2003
"... Dantzig, Fulkerson, and Johnson (1954) introduced the cuttingplane method as a means of attacking the traveling salesman problem; this method has been applied to broad classes of problems in combinatorial optimization and integer programming. In this paper we discuss an implementation of Dantzig et ..."
Abstract

Cited by 36 (6 self)
 Add to MetaCart
Dantzig, Fulkerson, and Johnson (1954) introduced the cuttingplane method as a means of attacking the traveling salesman problem; this method has been applied to broad classes of problems in combinatorial optimization and integer programming. In this paper we discuss an implementation of Dantzig et al.'s method that is suitable for TSP instances having 1,000,000 or more cities. Our aim is to use the study of the TSP as a step towards understanding the applicability and limits of the general cuttingplane method in largescale applications.
Propositional Satisfiability and Constraint Programming: a Comparative Survey
 ACM Computing Surveys
, 2006
"... Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two relatively independent threads of research, crossfertilising occasionally. These two approaches to problem solving have a lot in common, as evidenced by similar ideas underlying the branch and prune algorithms ..."
Abstract

Cited by 32 (4 self)
 Add to MetaCart
Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two relatively independent threads of research, crossfertilising occasionally. These two approaches to problem solving have a lot in common, as evidenced by similar ideas underlying the branch and prune algorithms that are most successful at solving both kinds of problems. They also exhibit differences in the way they are used to state and solve problems, since SAT’s approach is in general a blackbox approach, while CP aims at being tunable and programmable. This survey overviews the two areas in a comparative way, emphasising the similarities and differences between the two and the points where we feel that one technology can benefit from ideas or experience acquired