Algorithm for optimal winner determination in combinatorial auctions (Q5958538): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Leveled commitment contracts with myopic and strategic agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4371290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Set-Partitioning Problem: Set Covering with Equality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incentives in Teams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Object Auctions: Sequential vs. Simultaneous Sales / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient bounds for the stable set, vertex cover and set packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Auction with Multiple Winners for Universal Service / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-first iterative-deepening: An optimal admissible tree search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the maximum internally stable set in a weighted graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding a maximum weighted independent set in an arbitrary graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Manageable Combinational Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coalition structure generation with worst case guarantees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Leveled commitment contracts and strategic breach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054818 / rank
 
Normal rank

Latest revision as of 23:25, 3 June 2024

scientific article; zbMATH DE number 1715550
Language Label Description Also known as
English
Algorithm for optimal winner determination in combinatorial auctions
scientific article; zbMATH DE number 1715550

    Statements

    Algorithm for optimal winner determination in combinatorial auctions (English)
    0 references
    0 references
    3 March 2002
    0 references
    auction
    0 references
    combinatorial auction
    0 references
    multi-item auction
    0 references
    multi-object auction
    0 references
    didding with synergies
    0 references
    winner determination
    0 references
    multiagent systems
    0 references

    Identifiers