Learn More
The problem of Weighted Hypergraph Embedding in a Cycle (WHEC) is to embed the weighted hyperedges of a hypergraph as the paths in a cycle, such that the maximum congestion of any physical link in the cycle is minimized. A simpler version of this problem is the Weighted Graph Embedding in a Cycle (WGEC) that embeds the weighted edges of a normal graph as(More)
Determining winners in combinatorial auctions is an NP-complete problem. Based on the idea of searching Nash Equilibria (NE), this paper presents a local search procedure to determine winners. To improve the solution quality calculated by the local search, we propose Nash Equilibrium Search Approach (NESA) to probe various NE solutions. According to the(More)
The problem of Weighted Hypergraph Embedding in a Cycle (WHEC) is known to be NP-complete even when each hyperedge is unweighted or each weighted hyperedge contains exactly two vertices. In this paper, we propose an approximation algorithm for the WHEC problem to provide a solution with approximation bound of 1.5(opt + w max), where opt represents the(More)
In this study, we aim to develop a pricing mechanism that reduces the effects resulted by vindictive advertisers who bid on sponsored search auctions run by search engine providers. In particular, we aim to ensure payment fairness and price stability in these auctions. With the generalized second price principle, advertisers pay the next-ranked bid value(More)
This paper considers the energy saving problem of IEEE 802.16e networks which consist of a base station and multiple mobile stations. The mobile station may establish one or multiple connections that have specific QoS requirements, including a bandwidth requirement and delay bounds. Since the mobile station turns off the transceiver to save energy when all(More)