scientific article
From MaRDI portal
Publication:3588651
zbMath1194.91018MaRDI QIDQ3588651
No author found.
Publication date: 9 September 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to game theory, economics, and finance (91-06) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (only showing first 100 items - show all)
Large-Scale Bundle-Size Pricing: A Theoretical Analysis ⋮ An efficient ascending auction for private valuations ⋮ Strong mediated equilibrium ⋮ Computing leximin-optimal solutions in constraint networks ⋮ An options-based solution to the sequential auction problem ⋮ Revenue deficiency under second-price auctions in a supply-chain setting ⋮ A review on algorithms for maximum clique problems ⋮ Optimal combinatorial mechanism design ⋮ On the determination of European day ahead electricity prices: the Turkish case ⋮ Optimal bidding in auctions from a game theory perspective ⋮ Pricing combinatorial auctions by a set of linear price vectors ⋮ Mechanisms for a spatially distributed market ⋮ Setting lower bounds on truthfulness ⋮ A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction ⋮ A pricing scheme for combinatorial auctions based on bundle sizes ⋮ Primary versus secondary infrastructure capacity allocation mechanisms ⋮ Distributed fair allocation of indivisible goods ⋮ The Envy-Free Pricing Problem and Unit-Demand Markets ⋮ Submodular Functions: Learnability, Structure, and Optimization ⋮ Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions ⋮ Strong activity rules for iterative combinatorial auctions ⋮ Note on time bounds of two-phase algorithms for \(L\)-convex function minimization ⋮ Core-selecting auctions with incomplete information ⋮ Optimal allocation of MRI scan capacity among competing hospital departments ⋮ Fraction auctions: the tradeoff between efficiency and running time ⋮ Optimization with demand oracles ⋮ Dividing bads under additive utilities ⋮ An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools ⋮ Solving the winner determination problem in combinatorial auctions for fractional ownership of autonomous vehicles ⋮ Non-monetary coordination mechanisms for time slot allocation in warehouse delivery ⋮ A demand partitioning framework to reserve production for small enterprises ⋮ QUANTUM AUCTIONS ⋮ Identifying combinatorial valuations from aggregate demand ⋮ School choice with controlled choice constraints: hard bounds versus soft bounds ⋮ Compactly representing utility functions using weighted goals and the Max aggregator ⋮ Computing optimal outcomes under an expressive representation of settings with externalities ⋮ Competitive Equilibria for Non-quasilinear Bidders in Combinatorial Auctions ⋮ Winner determination in geometrical combinatorial auctions ⋮ On Lattice and DA ⋮ Bounds on the minimax rate for estimating a prior over a VC class from independent learning tasks ⋮ Multi-item Vickrey-English-Dutch auctions ⋮ Strategy-proofness of scoring allocation correspondences for indivisible goods ⋮ The cross-entropy method for the winner determination problem in combinatorial auctions ⋮ Expressive markets for donating to charities ⋮ Preference-based English reverse auctions ⋮ A Boolean programming problem of choosing an optimal portfolio of projects and optimal schedules for them by reinvesting within the portfolio the profit from project implementation ⋮ Computing Bayes-Nash Equilibria in Combinatorial Auctions with Verification ⋮ Truthful randomized mechanisms for combinatorial auctions ⋮ Computationally-feasible truthful auctions for convex bundles ⋮ Reformulation based MaxSat robustness ⋮ Modeling profit sharing in combinatorial exchanges by network flows ⋮ A combinatorial auction mechanism for surgical scheduling considering surgeon's private availability information ⋮ A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction ⋮ Auction optimization using regression trees and linear models as integer programs ⋮ Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems ⋮ First price package auction with many traders ⋮ Time bounds for iterative auctions: a unified approach by discrete convex analysis ⋮ The envy-free pricing problem, unit-demand markets and connections with the network pricing problem ⋮ Supplier selection by coupling-attribute combinatorial analysis ⋮ Buyback problem with discrete concave valuation functions ⋮ Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem ⋮ Truthful mechanism design via correlated tree rounding ⋮ Combinatorial auctions ⋮ Equilibria of Greedy Combinatorial Auctions ⋮ Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions ⋮ Informational limitations of ascending combinatorial auctions ⋮ Walrasian's characterization and a universal ascending auction ⋮ On the robustness of non-linear personalized price combinatorial auctions ⋮ Evaluating the impact of AND/OR search on 0-1 integer linear programming ⋮ Solving coalitional resource games ⋮ Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity ⋮ Computer science and decision theory ⋮ Revenue maximization of Internet of things provider using variable neighbourhood search ⋮ Compact bidding languages and supplier selection for markets with economies of scale and scope ⋮ A new characterization of equilibrium in multiple-object uniform-price auctions ⋮ Exact bounds for steepest descent algorithms of $L$-convex function minimization ⋮ Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions ⋮ A review of transport market modeling using game-theoretic principles ⋮ Multi-attribute online reverse auctions: recent research trends ⋮ A new pricing scheme based on DEA for iterative multi-unit combinatorial auctions ⋮ The stochastic bid generation problem in combinatorial transportation auctions ⋮ Limitations of randomized mechanisms for combinatorial auctions ⋮ On the Approximability of Combinatorial Exchange Problems ⋮ Experiments with probabilistic quantum auctions ⋮ Mechanism design for perturbation stable combinatorial auctions ⋮ Truthful approximation mechanisms for restricted combinatorial auctions ⋮ Solving multiple scenarios in a combinatorial auction ⋮ Efficiently Generating k-Best Solutions to Procurement Auctions ⋮ Non-bidding equilibrium in an ascending core-selecting auction ⋮ Block order restrictions in combinatorial electric energy auctions ⋮ Non-linear anonymous pricing combinatorial auctions ⋮ A capacity reservation game for suppliers with multiple blocks of capacity ⋮ Market-based pricing in grids: on strategic manipulation and computational cost ⋮ Strategy-proof multi-object mechanism design: ex-post revenue maximization with non-quasilinear preferences ⋮ Modeling the Pre Auction Stage The Truckload Case ⋮ Connected price dynamics with revealed preferences and Auctioneer's discretion in VCG combinatorial auction ⋮ Conflict and competition over multi-issues ⋮ Efficient combinatorial allocations: individual rationality versus stability ⋮ Multi-object auctions with resale: theory and experiment ⋮ Integrating production scheduling and transportation procurement through combinatorial auctions
This page was built for publication: