Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · cs/0010031

Opportunity Cost Algorithms for Combinatorial Auctions

Karhan Akcoglu·James Aspnes·Bhaskar DasGupta·Ming-Yang Kao
View original source ↗Read source document ↗Export metadata ↓

Abstract

Two general algorithms based on opportunity costs are given for approximating a revenue-maximizing set of bids an auctioneer should accept, in a combinatorial auction in which each bidder offers a price for some subset of the available goods and the auctioneer can only accept non-intersecting bids. Since this problem is difficult even to approximate in general, the algorithms are most useful when the bids are restricted to be connected node subsets of an underlying object graph that represents which objects are relevant to each other. The approximation ratios of the algorithms depend on structural properties of this graph and are small constants for many interesting families of object graphs. The running times of the algorithms are linear in the size of the bid graph, which describes the conflicts between bids. Extensions of the algorithms allow for efficient processing of additional constraints, such as budget constraints that associate bids with particular bidders and limit how many bids from a particular bidder can be accepted.

Explore related subjects

cs.CEcs.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Karhan Akcoglu, James Aspnes, Bhaskar DasGupta, Ming-Yang Kao. 2000-10-24. Opportunity Cost Algorithms for Combinatorial Auctions. https://arxiv.org/abs/cs/0010031

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Computational Construction and Engineering Evaluation of a Verified Mono-Monostatic Body

Many engineering failures in orientation-dependent systems are geometric failure modes: changing the material delays the failure; changing the geometry can eliminate it. The mono-monostatic property (exactly one stable equilibrium under gravity) is mathematically proven to exist in convex homogeneous bodies, but, to our knowledge, no verified smooth geometry had been openly published when v1 appeared (April 2026). We introduce an Equilibrium Count Score (ECS) oracle that measures stable equilibria via drainage basin analysis on the center-of-mass height landscape. v2 correction: v1 reported that Sloan's (2023) analytical Gomboc parameterization shows 4-11 local minima "at all published parameter values." That claim is withdrawn. The beta values swept were this work's own grid points, not Sloan's (he states convexity bounds beta <= 0.15 and beta <= 0.17); they lie inside the strictly convex sub-regime beta < ~0.036, where a body at beta = 0.023 was later certified mono-monostatic by interval arithmetic; and the oracle's two stages are biased in opposite directions, so its count can be wrong either way. We construct one strictly convex mono-monostatic body by extending the Sloan phase function with a Fourier term and optimizing via differential evolution, with ECS=1 confirmed across merge thresholds from 0.5% to 10%; two more reach ECS=1 under the oracle but are not strictly convex. Conventional geometries cannot achieve ECS=1 through ballast alone: cylinders and cubes retain multiple stable equilibria even at 30% bottom-weighted mass. Applications: an IMU calibration housing (349x orientation precision improvement), aerial reforestation seed pods (20-67% germination loss from incorrect landing orientation), and marine buoy self-righting. Cross-layer scoring shows the Gomboc is 11.8x worse than the cylinder on contact distribution while optimal on equilibrium stability.

cs.CE↗
arXiv2026

Uncertainty-aware neural emulation reveals climate-resilient maize traits at scale

Climate change threatens maize yields worldwide, yet identifying which genetic traits sustain productivity under future conditions requires exploring an enormous space of genotype, soil, and climate combinations that process-based crop models are too costly to simulate at scale. Here we develop an integrated probabilistic emulation framework that transforms a mechanistic crop simulator (APSIM) into a fast, uncertainty-aware discovery engine. Built from two million simulations and coupled to a generative weather model that produces realistic climate sequences, the emulator reproduces thirteen maize growth outputs with high fidelity while returning calibrated confidence for every prediction, at a fraction of the original computational cost. Applying it across 100,000 trait configurations, six locations, and future climate projections extending to the year 2100, we identify 1,114 trait combinations that remain resilient under the 2100 future conditions and a stricter subset of 246 configurations that remain resilient across four future projection periods: 2040, 2060, 2080, and 2100. These resilient configurations occupy a distinct region of trait space, combining high radiation use efficiency with characteristic shifts in developmental and reproductive traits. Trait-importance analysis further identifies radiation use efficiency as the dominant driver of yield under future climate, while projected yields vary widely across locations and climate models, indicating strong spatial heterogeneity in the maize response to climate change.

cs.CE↗
arXiv2026

EPIC: Differentiable Energy-Force Consistent Uncertainty Quantification and Propagation for Machine-Learned Interatomic Potentials

Machine-learned interatomic potentials (MLIPs) now rival density functional theory in accuracy and are increasingly used to screen vast crystal databases, yet they can produce unreliable predictions for chemistries outside their training distribution without clear warning. Existing force-level evidential approaches do not inherently define a corresponding uncertainty model over the potential energy surface, limiting the consistent propagation of uncertainty to energy-derived observables. Here we introduce Energy-Propagated Intrinsic Confidence (EPIC), a general energy-centered evidential framework that derives forces as exact gradients of the predicted mean energy, ensuring conservative force fields while providing an analytical estimate of energy uncertainty. Coupled to a MACE backbone trained on the Materials Project trajectory dataset, EPIC propagates uncertainty diagnostics to equations of state, anisotropic structural uncertainty ellipsoids, and phonon dispersions through a Monte Carlo procedure. Applied to 10,966 candidate crystals, the fraction classified as robustly dynamically stable increases from 11\% in the highest-uncertainty quartile to 53\% in the lowest-uncertainty quartile. Furthermore, element-resolved analysis reveals a pronounced chemistry dependence in the relationship between epistemic uncertainty and predicted dynamical stability, highlighting potential limitations in the description of complex bonding environments. EPIC thus provides a physics-aware, chemistry-sensitive uncertainty diagnostic for high-throughput screening and autonomous materials discovery.

cs.CE↗