-
Article
Stackelberg Network Pricing Games
We study a multi-player one-round game termed Stackelberg Network Pricing Game, in which a leader can set prices for a subset of m priceable edges in a graph. The other edges have a fixed cost. Based on the leade...
-
Chapter and Conference Paper
The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers
We study an extension of the unit-demand pricing problem in which the seller may offer bundles of items. If a customer buys such a bundle she is guaranteed to get one item out of it, but the seller does not ma...
-
Chapter and Conference Paper
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may assign prices to the pricable e...
-
Chapter and Conference Paper
On Stackelberg Pricing with Computationally Bounded Consumers
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset of the items. We focus on the cas...
-
Chapter and Conference Paper
On the Approximability of Combinatorial Exchange Problems
In a combinatorial exchange the goal is to find a feasible trade between potential buyers and sellers requesting and offering bundles of indivisible goods. We investigate the approximability of several optimiz...
-
Chapter and Conference Paper
Uniform Budgets and the Envy-Free Pricing Problem
We consider the unit-demand min-buying pricing problem, in which we want to compute revenue maximizing prices for a set of products ...
-
Chapter and Conference Paper
Who Should Pay for Forwarding Packets?
We present a game theoretic study of hybrid communication networks in which mobile devices can connect in an ad hoc fashion to a base station, possibly via a few hops using other mobile devices as intermediate...
-
Chapter and Conference Paper
Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels
We consider the problem of computing broadcast schedules for a speed-controlled channel minimizing overall energy consumption. Each request defines a strict deadline and we assume that sending at some speed s for...
-
Chapter and Conference Paper
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some progress where the expected o...
-
Chapter and Conference Paper
The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes
The investigation of evolutionary algorithms as adaptation schemes has a long history starting with Holland (1975). The Ising model from physics leads to a variety of different problem instances and it is inte...
