First-price path auctions

No abstract is available for this paper.

• Publication year

  2005

• Venue

  ACM Conference on Economics and Computation

• Publication date

  2005-06-05

• Fields of study

  Mathematics, Computer Science, Economics

• Identifiers
  DOI 10.1145/1064009.1064031
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On the expected payment of mechanisms for task allocation

  2004influential reference
• Frugality in path auctions

  2004influential reference
• Coalitional games on graphs: core structure, substitutes and frugality

  2003cited by this paper
• On certain connectivity properties of the Internet topology

  2003cited by this paper
• Pricing Communication Networks

  2003cited by this paper
• An approximate truthful mechanism for combinatorial auctions with single parameter agents

  2003cited by this paper
• A BGP-based mechanism for lowest-cost routing

  2002cited by this paper
• Frugal path mechanisms

  2002cited by this paper
• Vickrey prices and shortest paths: what is an edge worth?

  2001cited by this paper
• DIVISION OF THE HUMANITIES AND SOCIAL SCIENCES CALIFORNIA INSTITUTE OF TECHNOLOGY PASADENA, CALIFORNIA 91125 A CRASH COURSE IN IMPLEMENTATION THEORY

  1999cited by this paper
• Cost allocation, demand revelation, and core implementation

  1998influential reference
• Cooperative game theory and applications

  1997influential reference
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• Johnson: computers and intractability: a guide to the theory of np- completeness (freeman

  1979cited by this paper
• A group incentive compatible mechanism yielding core allocations

  1979cited by this paper
• Incentives in Teams

  1973cited by this paper
• Multipart pricing of public goods

  1971cited by this paper
• Counterspeculation, Auctions, And Competitive Sealed Tenders

  1961cited by this paper
• 16. Acceptable Points in General Cooperative n-Person Games

  1959cited by this paper

• Equilibrium Efficiency and Learning in Budgeted Procurement Marketplaces

  2025cites this paper
• Conflicting Bundle Allocation with Preferences in Weighted Directed Acyclic Graphs: Application to Orbit Slot Allocation Problems

  2023cites this paper
• A bandwidth auction mechanism to enable affordable internet access

  2021cites this paper
• FIMI: A Constant Frugal Incentive Mechanism for Time Window Coverage in Mobile Crowdsensing

  2017cites this paper
• Imperfect Price Competition in Networks

  2017cites this paper
• On Distributed Virtual Network Embedding With Guarantees

  2016cites this paper
• Coalitionally stable pricing schemes for inter-domain forwarding

  2016cites this paper
• Bounding the payment of approximate truthful mechanisms

  2015cites this paper
• Price competition in online combinatorial markets

  2014cites this paper
• Price Competition in Networked Markets: How Do Monopolies Impact Social Welfare?

  2014cites this paper
• Market price competition in networks: How do monopolies impact social welfare?

  2014cites this paper
• Auctions for social lending: A theoretical analysis

  2014cites this paper
• The price of imperfect competition for a spanning network

  2013cites this paper
• INCENTIVE COMPATIBLE DESIGN OF REVERSE AUCTIONS

  2013cites this paper
• A general distributed approach to slice embedding with guarantees

  2013cites this paper
• Business Aspects of Web Services

  2013cites this paper
• The Power of Uncertainty: Algorithmic Mechanism Design in Settings of Incomplete Information

  2012cites this paper
• Frugality in set-system auctions

  2012cites this paper
• Bayesian sequential auctions

  2012cites this paper
• VCG with Communities on Random Ad Hoc Networks

  2011cites this paper
• Sequential auctions and externalities

  2011cites this paper
• Pricing Strategies for Platform Providers

  2011cites this paper
• Dealing with Selfishness and Moral Hazard in Noncooperative Wireless Networks

  2010cites this paper
• Path auctions with multiple edge ownership

  2010cites this paper
• Essays on the Computation of Economic Equilibria and Its Applications

  2009influential citation
• Refining the Cost of Cheap Labor in Set System Auctions

  2009cites this paper
• Price of anarchy for greedy auctions

  2009cites this paper
• Social lending

  2009cites this paper
• Frugal and Truthful Auctions for Vertex Covers, Flows and Cuts

  2009cites this paper
• Frugal Mechanism Design via Spectral Techniques

  2009influential citation
• Towards an Internet Connectivity Market

  2009influential citation
• Frugal Routing on Wireless Ad-Hoc Networks

  2008cites this paper
• Provisioning of Service Mashup Topologies

  2008cites this paper
• Hidden information and actions in multi-hop wireless ad hoc networks

  2008cites this paper
• Routing game in hybrid wireless mesh networks with selfish mesh clients

  2008influential citation
• Planning and Pricing of Service Mashups

  2008cites this paper
• Path Auctions When an Agent Can Own Multiple Edges

  2007cites this paper
• Using Nash Implementation to Achieve Better Frugality Ratios

  2007cites this paper
• Incentivation of Service Providers for Efficient Service Composition Agreements

  2007cites this paper
• Towards Sharp Inapproximability For Any 2-CSP

  2007cites this paper
• On profit maximization in mechanism design

  2007cites this paper
• Pricing of partially compatible products

  2007cites this paper
• On the Price of Truthfulness in Path Auctions

  2007cites this paper
• Mechanism Design via Differential Privacy

  2007cites this paper
• Frugality ratios and improved truthful mechanisms for vertex cover

  2006cites this paper
• Incentive compatible cost- and stability-based routing in ad hoc networks

  2006cites this paper
• Path Auction Games When an Agent Can Own Multiple Edges ∗

  2006cites this paper
• Social Welfare Based Routing in Ad hoc Networks

  2006cites this paper
• Design differentiated service multicast with selfish agents

  2006cites this paper
• OURS: optimal unicast routing systems in non-cooperative wireless networks

  2006cites this paper
• Frugality ratios and improved truthful mechanisms for vertex cover

  2006cites this paper
• Truthful routing for wireless hybrid networks

  2005influential citation
• Computing with strategic agents

  2005cites this paper
• Nash Equilibria and Dominant Strategies in Routing

  2005cites this paper
• Beyond VCG: frugality of truthful mechanisms

  2005influential citation
• Ieee Transactions on Parallel and Distributed Systems 1 Enforcing Minimum-cost Multicast Routing against Selfish Information Flows

  year unknowncites this paper