A. Ronen. Solving Optimization Problems Among Selfish Agents. PhD thesis, Hebrew University in Jerusalem, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Deterministic Truthful Approximation Schemes for.. - Auletta, De.. (2003) (Correct)
....been applied to several optimization problems arising in computer science, networking and algorithmic questions related to the Internet (see [Pap01] for a survey) Several basic problems (e.g. shortest path, minimum spanning tree, etc. have been (re ) considered in the context of selfish agents [NR99, Ron00]: a network graph is composed by a set of weighted edges, each of them owned by an agent that privately knows the corresponding weight; this weight measures the cost for the corresponding agent in being chosen in the solution (e.g. the cost of forwarding tra#c over a link) In the seminal papers ....
.... weighted edges, each of them owned by an agent that privately knows the corresponding weight; this weight measures the cost for the corresponding agent in being chosen in the solution (e.g. the cost of forwarding tra#c over a link) In the seminal papers by Nisan and Ronen [NR99, NR00] see also [Ron00]) it is first pointed out that classical results in mechanism design theory, originated from micro economics and game theory, do not completely fit in a context where computational issues play a crucial role [NR00] Also, optimization problems arise (job scheduling being one of them) for which ....
[Article contains additional citation context not shown here]
A. Ronen. Solving Optimization Problems Among Selfish Agents. PhD thesis, Hebrew University in Jerusalem, 2000.
Stackelberg Scheduling Strategies - Roughgarden (2000) (9 citations) (Correct)
....that an appropriate (centralized) protocol at a network switch induces selfish users to exhibit good flow control behavior. An area of research that typically does not study Nash equilibria but is nevertheless concerned with controlling selfish behavior is that of algorithmic mechanism design [13, 20, 21, 25]. In this setting, an algorithm is designed to collect data from users and compute an outcome using this data (e.g. based on the bids of the users of the system, compute the set of users that will receive some good, such as a movie multicast over the Internet) The difficulty in these problems ....
....any set of latency functions. Problems studied in this paper. We focus on the problem described at the beginning of the paper, of scheduling jobs on a set of machines with load dependent latencies in order to minimize the total latency. In addition to being one of the most commonly studied models [12, 16, 19, 20, 21, 25] (occasionally in the equivalent formulation of routing on a set of parallel links) the simple setting of scheduling jobs on machines permits a study of the effects of different leader strategies in Stackelberg games without any additional complications, such as the issue of path selection in a ....
A. Ronen. Solving Optimization Problems among Selfish Agents. PhD thesis, Hebrew University of Jerusalem, 2000.
Stackelberg Scheduling Strategies - Roughgarden (2001) (9 citations) (Correct)
....behavior, and Roughgarden [30] studies the problem of designing networks that exhibit good performance when used selfishly. An area of research that typically does not study Nash equilibria but is nevertheless concerned with controlling selfish behavior is that of algorithmic mechanism design [1, 14, 23, 24, 29]. In this setting, an algorithm is designed to collect data from users and compute an outcome using this data (e.g. based on the bids of the users of the system, compute the set of users that will receive some good, such as a movie multicast over the Internet) The di#culty of these problems ....
....any set of latency functions. Problems studied in this paper We focus on the problem described at the beginning of the paper, of scheduling jobs on a set of machines with load dependent latencies in order to minimize the total latency. In addition to being one of the most commonly studied models [13, 17, 20, 23, 24, 29] (occasionally in the equivalent formulation of routing on a set of parallel links) the simple setting of scheduling jobs on machines permits a study of the e#ects of di#erent leader strategies in Stackelberg games without any additional complications, such as the issue of path selection in a ....
A. Ronen. Solving Optimization Problems among Selfish Agents. PhD thesis, Hebrew University of Jerusalem, 2000.
Energy Consumption in Radio Networks: Selfish.. - Ambühl, Clementi, .. (2003) (Correct)
No context found.
A. Ronen. Solving Optimization Problems Among Selfish Agents. PhD thesis, Hebrew University in Jerusalem, 2000.
Sharing the Cost of Multicast Transmissions in Wireless Networks - Penna, Ventre (2003) (Correct)
No context found.
A. Ronen. Solving Optimization Problems Among Selfish Agents. PhD thesis, Hebrew University in Jerusalem, 2000.
Deterministic Truthful Approximation Mechanisms for .. - Auletta, De.. (2003) (Correct)
No context found.
A. Ronen. Solving Optimization Problems Among Selfish Agents. PhD thesis, Hebrew University in Jerusalem, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC