Fine-grained efficient resource allocation using approximated combinatorial auctions
Combinatorial auctions, one of the most popular market mechanisms, have a huge effect on
electronic markets and political strategies. Combinatorial auctions provide suitable …
electronic markets and political strategies. Combinatorial auctions provide suitable …
An experimental analysis of biased parallel greedy approximation for combinatorial auctions
Considering emerging demands for auction based efficient resource allocations, the ability
to complete an auction within a fine-grained time period without loss of allocation efficiency …
to complete an auction within a fine-grained time period without loss of allocation efficiency …
Periodical resource allocation using approximated combinatorial auctions
Combinatorial auction, one of most popular market mechanisms, is well-known mechanism
for effective resource allocation to self-interested agents. In real scenarios, since the auction …
for effective resource allocation to self-interested agents. In real scenarios, since the auction …
Analysis of greedy heuristics and weight-coded eas for multidimensional knapsack problems and multi-unit combinatorial auctions
J Pfeiffer, F Rothlauf - Proceedings of the 9th annual Conference on …, 2007 - dl.acm.org
Analysis of Greedy Heuristics and Weight-Coded EAs for Multidimensional Knapsack
Problems and Multi-Unit Combinatorial Auctions Page 1 Analysis of Greedy Heuristics and …
Problems and Multi-Unit Combinatorial Auctions Page 1 Analysis of Greedy Heuristics and …
A winner determination algorithm for combinatorial auctions based on hybrid artificial fish swarm algorithm
G Zheng, ZC Lin - Physics Procedia, 2012 - Elsevier
The problem of winner determination in combinatorial auctions is a hotspot electronic
business, and a NP hard problem. A Hybrid Artificial Fish Swarm Algorithm (HAFSA), which …
business, and a NP hard problem. A Hybrid Artificial Fish Swarm Algorithm (HAFSA), which …
Short-time approximation on combinatorial auctions: a comparison on approximated winner determination algorithms
N Fukuta, T Ito - Proceedings of the 3rd international workshop on Data …, 2007 - dl.acm.org
Combinatorial auctions, one of the most popular market mechanisms, have a huge effect on
electronic markets and political strategies. In real scenarios, since the auction mechanism …
electronic markets and political strategies. In real scenarios, since the auction mechanism …
Toward a large scale e-market: A greedy and local search based winner determination
Combinatorial auction is one of the most popular market mechanisms and it has a huge
effect on electronic markets and political strategies. On large scale e-markets, we need a …
effect on electronic markets and political strategies. On large scale e-markets, we need a …
Fast partial reallocation in combinatorial auctions for iterative resource allocation
In this paper, we propose enhanced approximation algorithms of combinatorial auction that
are suitable for the purpose of periodical reallocation of items. Our algorithms are designed …
are suitable for the purpose of periodical reallocation of items. Our algorithms are designed …
Approximated winner determination for a series of combinatorial auctions
In this paper, we propose approximated winner determination algorithms for iteratively
conducted combinatorial auctions. Our algorithms are designed to effectively reuse last …
conducted combinatorial auctions. Our algorithms are designed to effectively reuse last …
The Trusted Function in Secure Decenralized Processing
PT Withington - 1980 IEEE Symposium on Security and Privacy, 1980 - ieeexplore.ieee.org
The information processors in a decentralized computing system must trust each other
enough to be mutually supportive, yet they must also protect themselves to maintain …
enough to be mutually supportive, yet they must also protect themselves to maintain …