Aaron Archer and Eva Tardos. Frugal path mechanisms. Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 991--999, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Reducing Truth-telling Online Mechanisms to Online.. - Baruch Awerbuch Yossi (2003) (10 citations) (Correct)
.... Truthtelling mechanism design is a longstanding problem in economics and gametheory, with one of the earlier examples being the Vickrey auction [18] and VCG mechanisms [18, 9, 14] In computer science theory, recent work has given results describing truthtelling mechanisms for shortest path [1], multicast [11] load balancing [17] allocation of goods [15, 7] and allocation of digital goods [8, 13] Many of these problems can be viewed in an online setting (where requests arrive one at a time in an adversarial fashion) and only some of the earlier results consider the online scenario. ....
A. Archer and E. Tardos. Frugal path mechanisms. Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, 2002.
Frugal Path Mechanisms - Archer, Tardos (33 citations) Self-citation (Archer Tardos) (Correct)
No context found.
A. Archer and E. Tardos. Frugal path mechanisms. In Proceedings of the 13 Annual ACMSIAM Symposium on Discrete Algorithms, pages 991--999, 2002.
Towards Generic Low Payment Mechanisms for Task - Allocation Artur Czumaj (Correct)
No context found.
Aaron Archer and Eva Tardos. Frugal path mechanisms. Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 991--999, 2002.
On the Expected Payment of Mechanisms for Task Allocation - Artur Czumaj Amir (Correct)
No context found.
A. Archer and E. Tardos. Frugal path mechanisms. Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 991--999, 2002.
Distributed Computing manuscript No. - Will Be Inserted (Correct)
No context found.
A. Archer and E. Tardos. Frugal path mechanisms. In Proceedings of 13th Symposium on Discrete Algorithms, ACM Press/SIAM, New York/Philadelphia, pages 991--999, 2002.
Failures of the VCG Mechanism in - Combinatorial Auctions And (Correct)
No context found.
A. Archer and E. Tardos. Frugal path mechanisms. In SODA, 991--999, 2002.
How Much Can Taxes Help Selfish Routing? - Cole, Dodis, Roughgarden (Correct)
No context found.
A. Archer and E. Tardos. Frugal path mechanisms. In Proceedings of the 13th Annual Symposium on Discrete Algorithms, pages 991--999, 2002.
Collusion-Resistant Mechanisms for Single-Parameter Agents - Goldberg, Hartline (2004) (Correct)
No context found.
A. Archer and E. Tardos. Frugal Path Mechanisms. In Proc. 13th Symp. on Discrete Alg. ACM/SIAM, 2002. 13
On the Expected Payment of Mechanisms for Task Allocation - Czumaj, Ronen (2004) (3 citations) (Correct)
No context found.
Aaron Archer and Eva Tardos. Frugal path mechanisms. Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 991--999, 2002.
Coalitional Games on Graphs: Core Structure, Substitutes - And Frugality Rahul (2002) (Correct)
No context found.
A. Archer and E. Tardos, "Frugal Path Mechanisms" in SODA 2002.
True Costs of Cheap Labor Are Hard To Measure: Edge Deletion and.. - Elkind (2004) (Correct)
No context found.
A. ARCHER AND E. TARDOS, Frugal path mechanisms. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 991--999, 2002
Frugality in Path Auctions - Elkind, Sahai, Steiglitz (2004) (7 citations) (Correct)
No context found.
A. Archer and E. Tardos, Frugal path mechanisms. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 991-999, 2002
Frugality in Path Auctions - Elkind, Sahai, Steiglitz (2003) (7 citations) (Correct)
No context found.
A. ARCHER AND E. TARDOS, Frugal path mechanisms. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 991--999, 2002
On the Difficulty of Some Shortest Path Problems - Hershberger, Suri, Bhosle (2003) (1 citation) (Correct)
No context found.
A. Archer and E. Tardos. Frugal path mechanisms. In Proc. 13th Annual ACMSIAM Symposium on Discrete Algorithms, pages 991--999, 2002.
Mechanism Design for Policy Routing - Feigenbaum, Sami, Shenker (2003) (1 citation) (Correct)
No context found.
A. Archer and E. Tardos. Frugal path mechanisms. In Proceedings of 13th ACM-SIAM Symposium on Discrete Algorithms (SODA '02), pages 991--999. ACM Press/SIAM, New York, 2002.
On the Difficulty of Some Shortest Path Problems - Hershberger, Suri, Bhosle (2003) (1 citation) (Correct)
No context found.
A. Archer and E. Tardos. Frugal path mechanisms. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 991-999, 2002.
Competitiveness via Consensus - Goldberg, Hartline (2002) (Correct)
No context found.
A. Archer and E. Tardos. Frugal Path Mechanisms. In Proc. 13th Symp. on Discrete Alg. ACM/SIAM, 2002.
Optimization in the Private Value Model: Competitive Analysis.. - Hartline (Correct)
No context found.
A. Archer and E. Tardos. Frugal Path Mechanisms. In To appear, SODA, 2002.
Reducing Truth-telling Online Mechanisms to Online.. - Awerbuch, Azar, Meyerson (2003) (10 citations) (Correct)
No context found.
A. Archer and E. Tardos. Frugal path mechanisms. Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, 2002.
A BGP-based Mechanism for Lowest-Cost Routing - Feigenbaum, Papadimitriou.. (2002) (34 citations) (Correct)
No context found.
A. Archer and E. Tardos. Frugal path mechanisms. In Proceedings of 13th Symposium on Discrete Algorithms, ACM Press/SIAM, New York/Philadelphia, pages 991-999, 2002.
A BGP-based Mechanism for Lowest-Cost Routing - Feigenbaum, Papadimitriou.. (2002) (34 citations) (Correct)
No context found.
A. Archer and E. Tardos. Frugal path mechanisms. In Proceedings of 13th Symposium on Discrete Algorithms, ACM Press/SIAM, New York/Philadelphia, pages 991--999, 2002.
Incentive-Compatible Interdomain Routing - Christos (2002) (1 citation) (Correct)
No context found.
A. Archer and E. Tardos. Frugal path mechanisms. In Proceedings of 13th Symposium on Discrete Algorithms, ACM Press/SIAM, New York/Philadelphia, pages 991-999, 2002.
Competitiveness via Consensus - Goldberg, Hartline (2002) (Correct)
No context found.
A. Archer and E. Tardos. Frugal Path Mechanisms. In Proc. 13th Symp. on Discrete Alg. ACM/SIAM, 2002.
Competitiveness via Consensus - Goldberg, Hartline (2002) (Correct)
No context found.
A. Archer and E. Tardos. Frugal Path Mechanisms. In Proc. 13th Symp. on Discrete Alg. ACM/SIAM, 2002.
Competitive Generalized Auctions - Fiat, Goldberg, Hartline, Karlin (2002) (26 citations) (Correct)
No context found.
A. Archer and E. Tardos. Frugal Path Mechanisms. In To appear, SODA, 2002.
First 50 documents
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