On the public citation graph

MDPOP

https://doi.org/10.1145/1160633.1160895
0 signed · 99 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11575726_3openalex-snapshot
A Budget-Balanced, Incentive-Compatible Scheme for Social Choice
inferredcites →https://doi.org/10.1007/11818175_11openalex-snapshot
Rationality and Adversarial Behavior in Multi-party Computation
inferredcites →https://doi.org/10.1007/11832072_16openalex-snapshot
Rational Secret Sharing, Revisited
inferredcites →https://doi.org/10.1007/3-540-61551-2_116openalex-snapshot
Modeling and solving distributed constraint satisfaction problems (DCSPs)
inferredcites →https://doi.org/10.1007/978-0-306-47828-4_72openalex-snapshot
The Demand-Revealing Process
inferredcites →https://doi.org/10.1007/978-1-4684-9277-4_6openalex-snapshot
Linear Programming and Vickrey Auctions
inferredcites →https://doi.org/10.1007/978-3-540-45172-3_13openalex-snapshot
Rationality and Self-Interest in Peer to Peer Networks
inferredcites →https://doi.org/10.1007/bf01934985openalex-snapshot
Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
inferredcites →https://doi.org/10.1007/s003550100152openalex-snapshot
A crash course in implementation theory
inferredcites →https://doi.org/10.1007/s00446-005-0122-yopenalex-snapshot
A BGP-based mechanism for lowest-cost routing
inferredcites →https://doi.org/10.1016/0004-3702(83)90015-2openalex-snapshot
Negotiation as a metaphor for distributed problem solving
inferredcites →https://doi.org/10.1016/0020-0190(88)90187-1openalex-snapshot
Yet another distributed depth-first-search algorithm
inferredcites →https://doi.org/10.1016/0020-0190(94)90103-1openalex-snapshot
Self-stabilizing depth-first search
inferredcites →https://doi.org/10.1016/0047-2727(75)90001-8openalex-snapshot
Incentives and public inputs
inferredcites →https://doi.org/10.1016/0047-2727(79)90043-4openalex-snapshot
Incentives and incomplete information
inferredcites →https://doi.org/10.1016/b978-012722442-8/50036-7openalex-snapshot
Querying the Internet with PIER
inferredcites →https://doi.org/10.1016/j.artint.2004.09.003openalex-snapshot
Adopt: asynchronous distributed constraint optimization with quality guarantees
inferredcites →https://doi.org/10.1016/j.artint.2005.01.006openalex-snapshot
The complexity of contract negotiation
inferredcites →https://doi.org/10.1016/j.artint.2006.11.003openalex-snapshot
AND/OR search spaces for graphical models
inferredcites →https://doi.org/10.1016/j.jet.2005.09.004openalex-snapshot
Ascending price Vickrey auctions for general valuations
inferredcites →https://doi.org/10.1016/s0004-3702(01)00159-xopenalex-snapshot
Algorithm for optimal winner determination in combinatorial auctions
inferredcites →https://doi.org/10.1016/s0899-8256(03)00045-9openalex-snapshot
The effect of false-name bids in combinatorial auctions: new fraud in internet auctions
inferredcites →https://doi.org/10.1017/9781316471609.007openalex-snapshot
The Clock-Proxy Auction: A Practical Combinatorial Auction Design
inferredcites →https://doi.org/10.1023/a:1010078712316openalex-snapshot
Algorithms for Distributed Constraint Satisfaction: A Review
inferredcites →https://doi.org/10.1023/a:1017949922773openalex-snapshot
The demand revealing process: To distribute the surplus
inferredcites →https://doi.org/10.1109/12.2189openalex-snapshot
Fault-tolerant distributed algorithm for election in complete networks
inferredcites →https://doi.org/10.1109/21.135688openalex-snapshot
Distributed constrained heuristic search
inferredcites →https://doi.org/10.1109/aamas.2004.249openalex-snapshot
Solving Distributed Constraint Optimization Problems Using Cooperative Mediation
inferredcites →https://doi.org/10.1109/aamas.2004.257openalex-snapshot
Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling
inferredcites →https://doi.org/10.1109/icdcs.1992.235101openalex-snapshot
Distributed constraint satisfaction for formalizing distributed problem solving
inferredcites →https://doi.org/10.1109/icde.2006.105openalex-snapshot
Network-Aware Operator Placement for Stream-Processing Systems
inferredcites →https://doi.org/10.1109/sfcs.2003.1238230openalex-snapshot
Towards a characterization of truthful combinatorial auctions
inferredcites →https://doi.org/10.1109/sfcs.2005.64openalex-snapshot
Rational Secure Computation and Ideal Mechanism Design
inferredcites →https://doi.org/10.1109/tse.1983.234958openalex-snapshot
Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
inferredcites →https://doi.org/10.1142/9789814261371_0004openalex-snapshot
MARKET-ORIENTED PROGRAMMING: SOME EARLY LESSONS
inferredcites →https://doi.org/10.1145/1011767.1011781openalex-snapshot
Specification faithfulness in networks with rational nodes
inferredcites →https://doi.org/10.1145/1064009.1064035openalex-snapshot
On decentralized incentive compatible mechanisms
inferredcites →https://doi.org/10.1145/1082473.1082633openalex-snapshot
Impact of problem centralization in distributed constraint optimization algorithms
inferredcites →https://doi.org/10.1145/1095809.1095816openalex-snapshot
BAR fault tolerance for cooperative services
inferredcites →https://doi.org/10.1145/1134707.1134722openalex-snapshot
Incentive-compatible interdomain routing
inferredcites →https://doi.org/10.1145/1160633.1160790openalex-snapshot
Optimal decision-making with minimal waste
inferredcites →https://doi.org/10.1145/1250910.1250915openalex-snapshot
Worst-case optimal redistribution of VCG payments
inferredcites →https://doi.org/10.1145/195058.195141openalex-snapshot
Simple and efficient leader election in the full information model
inferredcites →https://doi.org/10.1145/352871.352879openalex-snapshot
Towards a universal test suite for combinatorial auction algorithms
inferredcites →https://doi.org/10.1145/570810.570812openalex-snapshot
Distributed algorithmic mechanism design
inferredcites →https://doi.org/10.1145/571825.571856openalex-snapshot
A BGP-based mechanism for lowest-cost routing
inferredcites →https://doi.org/10.1145/860575.860844openalex-snapshot
Distributed breakout algorithm for distributed constraint optimization problems -- DBArelax
inferredcites →https://doi.org/10.1287/ijoc.15.3.284.16077openalex-snapshot
Combinatorial Auctions: A Survey
inferredcites →https://doi.org/10.1609/aimag.v15i3.1098openalex-snapshot
Designing conventions for automated negotiation
inferredcites →https://doi.org/10.1613/jair.1786openalex-snapshot
Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1613/jair.1870openalex-snapshot
Negotiating Socially Optimal Allocations of Resources
inferredcites →https://doi.org/10.1613/jair.2openalex-snapshot
A Market-Oriented Programming Environment and its Application to Distributed Multicommodity Flow Problems
inferredcites →https://doi.org/10.1613/jair.72openalex-snapshot
Mechanisms for Automated Negotiation in State Oriented Domains
inferredcites →https://doi.org/10.2307/1911219openalex-snapshot
Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods
inferredcites →https://doi.org/10.48550/arxiv.1207.4127openalex-snapshot
On finding minimal w-cutset
inferredcites →https://doi.org/10.5555/1283383.1283404openalex-snapshot
Strong price of anarchy
inferredcites →https://doi.org/10.5860/choice.33-0987openalex-snapshot
Introduction to distributed algorithms
inferredcites →https://doi.org/10.65109/fxaq8631openalex-snapshot
Distributed Implementations of Vickrey-Clarke-Groves Mechanisms
inferredcites →https://doi.org/10.7551/mitpress/8637.003.0011openalex-snapshot
Combinatorial Auctions
inferredcites →https://doi.org/10.7551/mitpress/9780262033428.003.0002openalex-snapshot
The Lovely but Lonely Vickrey Auction
inferredcites →https://doi.org/10.7551/mitpress/9780262033428.003.0019openalex-snapshot
A Test Suite for Combinatorial Auctions
inferredcites →https://doi.org/10.7551/mitpress/9780262033428.003.0021openalex-snapshot
Auctions for the Safe, Efficient, and Equitable Allocation of Airspace System Resources

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.3794860openalex-extracted
Auctions and bidding: A guide for computer scientists
inferred← citeshttps://doi.org/10.1002/9780470611098.ch7openalex-snapshot
Restricted Classes of Utility Functions for Simple Negotiation Schemes: Sufficiency, Necessity and Maximality
inferred← citeshttps://doi.org/10.1007/978-3-319-11421-7_5openalex-snapshot
A Distributed Constraint Optimization Approach for Vessel Rotation Planning
inferred← citeshttps://doi.org/10.1007/978-3-319-13191-7_22openalex-snapshot
An Extended Agent Based Model for Service Delivery Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-92185-1_60openalex-snapshot
Fault Tolerance in Distributed Mechanism Design
inferred← citeshttps://doi.org/10.1007/978-3-642-00457-5_3openalex-snapshot
Fairness with an Honest Minority and a Rational Majority
inferred← citeshttps://doi.org/10.1007/978-3-642-03214-1_24openalex-snapshot
Cost of Cooperation for Scheduling Meetings
inferred← citeshttps://doi.org/10.1007/978-981-96-0214-8_8openalex-snapshot
A Summary of Distributed Mechanism Design in Social Networks
inferred← citeshttps://doi.org/10.1007/s10458-009-9088-7openalex-snapshot
Simple negotiation schemes for agents with simple preferences: sufficiency, necessity and maximality
inferred← citeshttps://doi.org/10.1016/j.automatica.2025.112727openalex-snapshot
A truthful mechanism design for distributed optimisation algorithms in networks with self-interested agents
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80024-6openalex-snapshot
Distributed Constraint Programming
inferred← citeshttps://doi.org/10.1057/978-1-349-95121-5_2327-1openalex-snapshot
Computing in Mechanism Design
inferred← citeshttps://doi.org/10.1057/978-1-349-95189-5_2327openalex-snapshot
Computing in Mechanism Design
inferred← citeshttps://doi.org/10.1109/cdc.2014.7039768openalex-snapshot
Stability constrained incentive design for distributed frequency control of power grid
inferred← citeshttps://doi.org/10.1109/cdc.2015.7402548openalex-snapshot
Optimal incentive design for distributed stabilizing control of nonlinear dynamic networks
inferred← citeshttps://doi.org/10.1109/cimca.2008.9openalex-snapshot
A Distributed Platform for Mechanism Design
inferred← citeshttps://doi.org/10.1109/ciss50987.2021.9400216openalex-snapshot
Mechanism Design for Large Scale Network Utility Maximization
inferred← citeshttps://doi.org/10.1109/cse.2009.169openalex-snapshot
Privacy-Preserving Multi-agent Constraint Satisfaction
inferred← citeshttps://doi.org/10.1109/iat.2007.11openalex-snapshot
Optimal Solution Stability in Dynamic, Distributed Constraint Optimization
inferred← citeshttps://doi.org/10.1109/iat.2007.79openalex-snapshot
Persistently Effective Query Selection in Preference Elicitation
inferred← citeshttps://doi.org/10.1109/sest.2018.8495809openalex-snapshot
A rational decentralized generalized Nash equilibrium seeking for energy markets
inferred← citeshttps://doi.org/10.1109/tcns.2015.2489318openalex-snapshot
Faithful Implementations of Distributed Algorithms and Control Laws
inferred← citeshttps://doi.org/10.1109/tmc.2024.3499958openalex-snapshot
Large-Scale Mechanism Design for Networks: Superimposability and Dynamic Implementation
inferred← citeshttps://doi.org/10.1109/tpwrs.2017.2771945openalex-snapshot
A Faithful and Tractable Distributed Mechanism for Residential Electricity Pricing
inferred← citeshttps://doi.org/10.1109/tsmc.2023.3296643openalex-snapshot
Optimal Bilevel Lottery Design for Multiagent Systems
inferred← citeshttps://doi.org/10.1145/1160633.1160790openalex-snapshot
Optimal decision-making with minimal waste
inferred← citeshttps://doi.org/10.1145/1329125.1329262openalex-snapshot
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
inferred← citeshttps://doi.org/10.1145/1660877.1660909openalex-snapshot
Analyzing the performance of distributed algorithms
inferred← citeshttps://doi.org/10.1145/1883612.1883617openalex-snapshot
Auctions and bidding
inferred← citeshttps://doi.org/10.1609/aaai.v27i1.8640openalex-snapshot
Cost-Optimal Planning by Self-Interested Agents
inferred← citeshttps://doi.org/10.3166/ria.23.651-672openalex-snapshot
La maximisation du bien-être utilitaire des sociétés d'agents
inferred← citeshttps://doi.org/10.3233/wia-140288openalex-snapshot
Dynamic multiagent load balancing using distributed constraint optimization techniques
inferred← citeshttps://doi.org/10.48550/arxiv.0711.2618openalex-snapshot
A System for Distributed Mechanisms: Design, Implementation and Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1405.1734openalex-snapshot
Logic and Constraint Logic Programming for Distributed Constraint Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1705.03916openalex-snapshot
Solving Distributed Constraint Optimization Problems Using Logic Programming
inferred← citeshttps://doi.org/10.48550/arxiv.2003.04263openalex-snapshot
Mechanism Design for Large Scale Network Utility Maximization
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3942openalex-snapshot
A class of algorithms for distributed constraint optimization
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.