Beyond the PPAD hardness of Auto-bidding Auctions | Paper Citation Record

Observation 9792269f-1fc8-4858-9d89-d847e0f042ef · outbound

This paper cites Auto-bidding and auctions in online advertising: A survey.

Beyond the PPAD hardness of Auto-bidding Auctions Auto-bidding and auctions in online advertising: A survey

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:43.920930Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 609c3554-7993-4f78-bb38-583e3dccfee9 · outbound

This paper cites Selling joint ads: A regret minimization perspective.

Beyond the PPAD hardness of Auto-bidding Auctions Selling joint ads: A regret minimization perspective

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:43.925490Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b62e7d98-c7cd-40e6-90d1-374d69437a5a · outbound

This paper cites Aggarwal, A.

Beyond the PPAD hardness of Auto-bidding Auctions Aggarwal, A

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:43.929822Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 89c98a8f-a0fe-449d-949c-0d91387bb4c6 · outbound

This paper cites Existence of an equilibrium for a competitive economy.

Beyond the PPAD hardness of Auto-bidding Auctions Existence of an equilibrium for a competitive economy

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:43.934252Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4b4ce119-42ee-4706-9eca-f3d8ff98333c · outbound

This paper cites Online bandit learning against an adaptive adversary: from regret to policy regret.

Beyond the PPAD hardness of Auto-bidding Auctions Online bandit learning against an adaptive adversary: from regret to policy regret

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:43.938898Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a00b1aaa-e1da-4eb6-9adf-cd1f91a30726 · outbound

This paper cites A convergence theory for saddle functions.

Beyond the PPAD hardness of Auto-bidding Auctions A convergence theory for saddle functions

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:43.944354Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a6a18918-bca3-4b46-885c-3a442de6b5d2 · outbound

This paper cites A dynamic near-optimal algorithm for online linear programming.

Beyond the PPAD hardness of Auto-bidding Auctions A dynamic near-optimal algorithm for online linear programming

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:43.953865Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0778320a-78ce-40ea-9820-054e3a73c68c · outbound

This paper cites Approximating nash equilibria and dense bipartite subgraphs via an approximate version of carath\'eodory's theorem.

Beyond the PPAD hardness of Auto-bidding Auctions Approximating nash equilibria and dense bipartite subgraphs via an approximate version of carath\'eodory's theorem

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:43.958034Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 899c04c7-8d5f-4a6b-82f0-95c0f7f58e66 · outbound

This paper cites Smoothed complexity of 2-player nash equilibria.

Beyond the PPAD hardness of Auto-bidding Auctions Smoothed complexity of 2-player nash equilibria

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:43.962207Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 317bf487-c98b-44bb-ad53-342d44522e6f · outbound

This paper cites Repeated auctions with budgets in ad exchanges: Approximations and design.

Beyond the PPAD hardness of Auto-bidding Auctions Repeated auctions with budgets in ad exchanges: Approximations and design

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:43.966754Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 53c10042-e60a-4d76-b66b-24827bcf3c09 · outbound

This paper cites The best of both worlds: Asymptotically efficient mechanisms with a guarantee on the expected gains-from-trade.

Beyond the PPAD hardness of Auto-bidding Auctions The best of both worlds: Asymptotically efficient mechanisms with a guarantee on the expected gains-from-trade

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:43.971163Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aeda1e01-8508-4a66-a776-ae1753bc883b · outbound

This paper cites Dynamics of bid optimization in online advertisement auctions.

Beyond the PPAD hardness of Auto-bidding Auctions Dynamics of bid optimization in online advertisement auctions

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:43.975505Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b913ac32-418a-4add-bd97-3527da064158 · outbound

This paper cites Smoothed online learning is as easy as statistical learning.

Beyond the PPAD hardness of Auto-bidding Auctions Smoothed online learning is as easy as statistical learning

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:43.980160Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9cf91bc4-0308-4d8f-8b88-34b900705f05 · outbound

This paper cites Achieving optimal backlog in multi-processor cup games.

Beyond the PPAD hardness of Auto-bidding Auctions Achieving optimal backlog in multi-processor cup games

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:43.984692Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cbaaa86a-2e2e-461e-8dee-2a213c8d6882 · outbound

This paper cites Nash stability in social distance games.

Beyond the PPAD hardness of Auto-bidding Auctions Nash stability in social distance games

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:43.989124Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4e90bf56-3823-4c8d-923d-090ee3701a01 · outbound

This paper cites Learning in repeated auctions with budgets: Regret minimization and equilibrium.

Beyond the PPAD hardness of Auto-bidding Auctions Learning in repeated auctions with budgets: Regret minimization and equilibrium

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:43.993144Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e7607dcf-9f0f-4102-9675-ac210da77b40 · outbound

This paper cites Bulow-klemperer-style results for welfare maximization in two-sided markets.

Beyond the PPAD hardness of Auto-bidding Auctions Bulow-klemperer-style results for welfare maximization in two-sided markets

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:43.997305Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 11a92938-6504-4d71-9493-e16f44da023a · outbound

This paper cites Truthful Mechanisms for Two-Sided Markets via Prophet Inequalities.

Beyond the PPAD hardness of Auto-bidding Auctions Truthful Mechanisms for Two-Sided Markets via Prophet Inequalities

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.001614Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4f0e5f98-0363-4306-b5be-e84ec2368108 · outbound

This paper cites Balseiro, C.

Beyond the PPAD hardness of Auto-bidding Auctions Balseiro, C

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.006419Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bb3877fa-baca-4c52-8079-cd59b3f64f46 · outbound

This paper cites Budget-management strategies in repeated auctions.

Beyond the PPAD hardness of Auto-bidding Auctions Budget-management strategies in repeated auctions

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.010662Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d9550984-f3d1-4ac4-ba05-5d9e0e7aad88 · outbound

This paper cites One-dimensional empirical measures, order statistics, and Kantorovich transport distances , volume 261.

Beyond the PPAD hardness of Auto-bidding Auctions One-dimensional empirical measures, order statistics, and Kantorovich transport distances , volume 261

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.014953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 18e73c04-1957-48c4-a6b8-9f15fce3f92a · outbound

This paper cites Agnostic smoothed online learning.

Beyond the PPAD hardness of Auto-bidding Auctions Agnostic smoothed online learning

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.019115Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 55b6f64c-102b-4bd4-a796-61818f6241ec · outbound

This paper cites Balseiro, H.

Beyond the PPAD hardness of Auto-bidding Auctions Balseiro, H

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.023151Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a90a131e-453b-46e2-a434-ab52f4531778 · outbound

This paper cites Approximation algorithms for the weighted nash social welfare via convex and non-convex programs.

Beyond the PPAD hardness of Auto-bidding Auctions Approximation algorithms for the weighted nash social welfare via convex and non-convex programs

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.027128Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation edc94fd1-edf5-498f-9d2e-d93b04a87fcf · outbound

This paper cites Convex optimization: Algorithms and complexity.

Beyond the PPAD hardness of Auto-bidding Auctions Convex optimization: Algorithms and complexity

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.031109Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 89cf03a4-f097-4147-a02a-76a0f4dd2b79 · outbound

This paper cites Convex optimization.

Beyond the PPAD hardness of Auto-bidding Auctions Convex optimization

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.035295Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c02a9e10-2c76-470c-80c2-a21f5c51a0e7 · outbound

This paper cites Online learning with switching costs and other adaptive adversaries.

Beyond the PPAD hardness of Auto-bidding Auctions Online learning with switching costs and other adaptive adversaries

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.039603Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f8f76e9c-d32a-4159-a087-8183aebd9185 · outbound

This paper cites Fair division of indivisible goods for a class of concave valuations.

Beyond the PPAD hardness of Auto-bidding Auctions Fair division of indivisible goods for a class of concave valuations

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.043794Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a90c57cd-ddff-4029-9731-1dbab1c16d12 · outbound

This paper cites Online learning with knapsacks: the best of both worlds.

Beyond the PPAD hardness of Auto-bidding Auctions Online learning with knapsacks: the best of both worlds

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.048574Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 64f6baca-d7b3-411b-96b1-d6dac86613e5 · outbound

This paper cites Recent development in computational complexity characterization of nash equilibrium.

Beyond the PPAD hardness of Auto-bidding Auctions Recent development in computational complexity characterization of nash equilibrium

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.053172Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6cdcf98f-9d9f-4f11-8428-7c9bb0c8450e · outbound

This paper cites Convex program duality, fisher markets, and nash social welfare.

Beyond the PPAD hardness of Auto-bidding Auctions Convex program duality, fisher markets, and nash social welfare

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.057300Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fc1ff525-ba85-4a65-bcbd-8a2c03aae5d8 · outbound

This paper cites Playing anonymous games using simple strategies.

Beyond the PPAD hardness of Auto-bidding Auctions Playing anonymous games using simple strategies

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.061754Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1325a3e5-c3f4-4347-8d9f-aa10048d1ccb · outbound

This paper cites Computing nash equilibria: Approximation and smoothed complexity.

Beyond the PPAD hardness of Auto-bidding Auctions Computing nash equilibria: Approximation and smoothed complexity

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.066249Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 00a423be-38fc-44d2-8356-81bc7862e885 · outbound

This paper cites Settling the complexity of computing two-player nash equilibria.

Beyond the PPAD hardness of Auto-bidding Auctions Settling the complexity of computing two-player nash equilibria

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.071041Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ffa3c0b5-f6ec-4719-b99b-b87469a0213c · outbound

This paper cites A simple mechanism for a budget-constrained buyer.

Beyond the PPAD hardness of Auto-bidding Auctions A simple mechanism for a budget-constrained buyer

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.075396Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 71587d68-2f94-42dd-ac90-f70b45591f8e · outbound

This paper cites The query complexity of uniform pricing.

Beyond the PPAD hardness of Auto-bidding Auctions The query complexity of uniform pricing

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.079845Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a075d39f-bb2a-475f-9e07-53e90243c010 · outbound

This paper cites The complexity of pacing for second-price auctions.

Beyond the PPAD hardness of Auto-bidding Auctions The complexity of pacing for second-price auctions

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.084437Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c85ac551-3f72-4e35-a8aa-a687b8be50a7 · outbound

This paper cites Pacing equilibrium in first price auction markets.

Beyond the PPAD hardness of Auto-bidding Auctions Pacing equilibrium in first price auction markets

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.093566Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4f5f0dc9-8b97-4cbb-8938-141c7589cb06 · outbound

This paper cites Multiplicative pacing equilibria in auction markets.

Beyond the PPAD hardness of Auto-bidding Auctions Multiplicative pacing equilibria in auction markets

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.097772Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c0a120cf-f511-46c2-af13-d08bebf05af1 · outbound

This paper cites Restricted max-min fair allocation.

Beyond the PPAD hardness of Auto-bidding Auctions Restricted max-min fair allocation

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.106586Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0b451be1-0fd3-48f0-ac81-8ed80f68884b · outbound

This paper cites Theoretical properties of the log-concave maximum likelihood estimator of a multidimensional density.

Beyond the PPAD hardness of Auto-bidding Auctions Theoretical properties of the log-concave maximum likelihood estimator of a multidimensional density

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.110947Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 734965c0-9478-408a-b122-2d0d0b51e37f · outbound

This paper cites Dynamic budget throttling in repeated second-price auctions.

Beyond the PPAD hardness of Auto-bidding Auctions Dynamic budget throttling in repeated second-price auctions

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.115251Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9ca845b1-679c-4633-a4b1-6c25c3b555ab · outbound

This paper cites Faster stochastic algorithms for minimax optimization under polyak- \ L \ ojasiewicz condition.

Beyond the PPAD hardness of Auto-bidding Auctions Faster stochastic algorithms for minimax optimization under polyak- \ L \ ojasiewicz condition

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.119651Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 651a0bba-59a1-45d3-b89a-836b5305c239 · outbound

This paper cites Budget-constrained auctions with unassured priors: Strategic equivalence and structural properties.

Beyond the PPAD hardness of Auto-bidding Auctions Budget-constrained auctions with unassured priors: Strategic equivalence and structural properties

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.124370Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation abd330f3-deae-4b4d-a7eb-85cb8e3356e1 · outbound

This paper cites Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems.

Beyond the PPAD hardness of Auto-bidding Auctions Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.128300Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 74e42118-5067-469b-a764-aa3af5b46e98 · outbound

This paper cites Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized nash equilibrium problems.

Beyond the PPAD hardness of Auto-bidding Auctions Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized nash equilibrium problems

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.137552Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e700c137-03a8-4c7e-bc52-0ee0048a3738 · outbound

This paper cites Efficiency guarantees in auctions with budgets.

Beyond the PPAD hardness of Auto-bidding Auctions Efficiency guarantees in auctions with budgets

Reference 51

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.141782Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a42cd72c-fc98-4d95-b425-397caa1b58a0 · outbound

This paper cites Autobidding equilibria in sponsored shopping.

Beyond the PPAD hardness of Auto-bidding Auctions Autobidding equilibria in sponsored shopping

Reference 52

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.146238Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 89b5fa68-bf25-446b-91b1-afbbc029425d · outbound

This paper cites Secretaries with advice.

Beyond the PPAD hardness of Auto-bidding Auctions Secretaries with advice

Reference 53

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.150310Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 123e9b76-2094-4a5e-a38a-13b3014068b2 · outbound

This paper cites A combinatorial polynomial algorithm for the linear arrow-debreu market.

Beyond the PPAD hardness of Auto-bidding Auctions A combinatorial polynomial algorithm for the linear arrow-debreu market

Reference 54

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.154906Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cf80c217-14ff-461d-81e3-37161c9044e9 · outbound

This paper cites Online markov decision processes.

Beyond the PPAD hardness of Auto-bidding Auctions Online markov decision processes

Reference 55

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.159173Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2f0a91e8-43fc-4147-a3f0-39ebd6dc8cb1 · outbound

This paper cites Consensus of subjective probabilities: The pari-mutuel method.

Beyond the PPAD hardness of Auto-bidding Auctions Consensus of subjective probabilities: The pari-mutuel method

Reference 56

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.163874Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 20e8ffbf-81a3-4333-a870-8f49861ba728 · outbound

This paper cites Online allocation with traffic spikes: Mixing adversarial and stochastic models.

Beyond the PPAD hardness of Auto-bidding Auctions Online allocation with traffic spikes: Mixing adversarial and stochastic models

Reference 57

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.168600Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 871756e1-6fb7-494f-a3a5-1a3bf21ca5c3 · outbound

This paper cites Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords.

Beyond the PPAD hardness of Auto-bidding Auctions Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords

Reference 58

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.172959Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7b6ab88f-e5f8-4a68-8df1-821985d97aad · outbound

This paper cites Finite-dimensional variational inequalities and complementarity problems, 2003.

Beyond the PPAD hardness of Auto-bidding Auctions Finite-dimensional variational inequalities and complementarity problems, 2003

Reference 59

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.177075Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 82dc8a75-1d6d-4c64-9c2a-ed03ec8c8a61 · outbound

This paper cites Generalized nash equilibrium problems and newton methods.

Beyond the PPAD hardness of Auto-bidding Auctions Generalized nash equilibrium problems and newton methods

Reference 60

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.181061Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 23a6000e-02a0-4d64-bd73-246da6dbd41b · outbound

This paper cites Convergence analysis of no-regret bidding algorithms in repeated auctions.

Beyond the PPAD hardness of Auto-bidding Auctions Convergence analysis of no-regret bidding algorithms in repeated auctions

Reference 61

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.185164Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 75d92271-cce5-4705-a3b0-e65fe7335864 · outbound

This paper cites Constant approximation for weighted nash social welfare with submodular valuations.

Beyond the PPAD hardness of Auto-bidding Auctions Constant approximation for weighted nash social welfare with submodular valuations

Reference 62

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.189693Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e29e0b66-7159-4030-a29f-9d536c219c2a · outbound

This paper cites Generalized nash equilibrium problems.

Beyond the PPAD hardness of Auto-bidding Auctions Generalized nash equilibrium problems

Reference 63

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.194040Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a2dffa9a-2350-4bf1-8682-a0df5cce737e · outbound

This paper cites Penalty methods for the solution of generalized nash equilibrium problems.

Beyond the PPAD hardness of Auto-bidding Auctions Penalty methods for the solution of generalized nash equilibrium problems

Reference 64

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.198169Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation da89f84e-ad70-43d0-b483-c3ab7af523ff · outbound

This paper cites Learning in Budgeted Auctions with Spacing Objectives.

Beyond the PPAD hardness of Auto-bidding Auctions Learning in Budgeted Auctions with Spacing Objectives

Reference 65

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.202387Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f7cd7541-6d8f-4ea2-8e5f-3b9ce1380267 · outbound

This paper cites an unresolved cited work.

Beyond the PPAD hardness of Auto-bidding Auctions Unresolved cited work

Reference 66

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.207079Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0af92452-ed73-4074-8448-db074a22e403 · outbound

This paper cites an unresolved cited work.

Beyond the PPAD hardness of Auto-bidding Auctions Unresolved cited work

Reference 67

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.211756Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation de8642b5-ba9c-4e89-a283-ee33c9478c8d · outbound

This paper cites Consensus-halving: Does it ever get easier? In Proceedings of the 21st ACM Conference on Economics and Computation (EC) , 2020.

Beyond the PPAD hardness of Auto-bidding Auctions Consensus-halving: Does it ever get easier? In Proceedings of the 21st ACM Conference on Economics and Computation (EC) , 2020

Reference 68

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.216483Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 545893b1-79ff-485f-a14b-49c448447b15 · outbound

This paper cites Liquid welfare guarantees for no-regret learning in sequential budgeted auctions.

Beyond the PPAD hardness of Auto-bidding Auctions Liquid welfare guarantees for no-regret learning in sequential budgeted auctions

Reference 69

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.221076Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7f310aa6-d7a6-4150-b01a-1fabc7501fb0 · outbound

This paper cites On profit-maximizing envy-free pricing.

Beyond the PPAD hardness of Auto-bidding Auctions On profit-maximizing envy-free pricing

Reference 70

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.227371Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aa48a17b-5105-40c2-b2ef-8359e2d86321 · outbound

This paper cites A smoothed fptas for equilibria in congestion games.

Beyond the PPAD hardness of Auto-bidding Auctions A smoothed fptas for equilibria in congestion games

Reference 71

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.233426Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3e62e8de-9e2d-43ee-9c46-fe6e2829f039 · outbound

This paper cites First-order methods for large-scale market equilibrium computation.

Beyond the PPAD hardness of Auto-bidding Auctions First-order methods for large-scale market equilibrium computation

Reference 72

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.237625Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7d2ee81c-6cbc-46dd-98c5-3be9c773efa7 · outbound

This paper cites Budget pacing in repeated auctions: Regret and efficiency without convergence.

Beyond the PPAD hardness of Auto-bidding Auctions Budget pacing in repeated auctions: Regret and efficiency without convergence

Reference 73

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.242432Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e0326fa1-3496-4fd8-8e11-8ee623387178 · outbound

This paper cites The landscape of the proximal point method for nonconvex--nonconcave minimax optimization.

Beyond the PPAD hardness of Auto-bidding Auctions The landscape of the proximal point method for nonconvex--nonconcave minimax optimization

Reference 74

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.247291Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cd686e04-f7a3-4947-a805-1e15dbaaf094 · outbound

This paper cites Procurement Auctions with Best and Final Offers.

Beyond the PPAD hardness of Auto-bidding Auctions Procurement Auctions with Best and Final Offers

Reference 75

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.251702Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b49660df-a11b-451b-b85b-780687273cc8 · outbound

This paper cites Generalized nash games and quasi-variational inequalities.

Beyond the PPAD hardness of Auto-bidding Auctions Generalized nash games and quasi-variational inequalities

Reference 77

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.260879Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bea27b34-c23e-4208-bd6b-6f4638b8debd · outbound

This paper cites Matrix analysis.

Beyond the PPAD hardness of Auto-bidding Auctions Matrix analysis

Reference 78

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.265408Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0ef27898-a6a9-4d77-b176-a3b66880d793 · outbound

This paper cites Smoothed analysis with adaptive adversaries.

Beyond the PPAD hardness of Auto-bidding Auctions Smoothed analysis with adaptive adversaries

Reference 79

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.269503Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 595db013-bb64-4c9c-b361-cc8118c47999 · outbound

This paper cites Strong Equilibria in Bayesian Games with Bounded Group Size.

Beyond the PPAD hardness of Auto-bidding Auctions Strong Equilibria in Bayesian Games with Bounded Group Size

Reference 80

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.273620Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 60e33854-bf69-4197-9358-01f2c292c351 · outbound

This paper cites Adwords in a panorama.

Beyond the PPAD hardness of Auto-bidding Auctions Adwords in a panorama

Reference 81

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.278062Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f636bbd3-c88c-41ba-b86d-c852c7b90741 · outbound

This paper cites Selfishmigrate: A scalable algorithm for non-clairvoyantly scheduling heterogeneous processors.

Beyond the PPAD hardness of Auto-bidding Auctions Selfishmigrate: A scalable algorithm for non-clairvoyantly scheduling heterogeneous processors

Reference 82

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.282254Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 14daf18f-200d-467e-9cb4-783c1837e52f · outbound

This paper cites Immorlica, K.

Beyond the PPAD hardness of Auto-bidding Auctions Immorlica, K

Reference 83

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.286815Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8c9e08db-8acb-4871-8555-db6ced6cb5ed · outbound

This paper cites First-order algorithms for nonlinear generalized nash equilibrium problems.

Beyond the PPAD hardness of Auto-bidding Auctions First-order algorithms for nonlinear generalized nash equilibrium problems

Reference 84

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.291347Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f7660794-84e7-4948-bf6e-0be018d25db1 · outbound

This paper cites Efficiently computing nash equilibria in adversarial team markov games.

Beyond the PPAD hardness of Auto-bidding Auctions Efficiently computing nash equilibria in adversarial team markov games

Reference 85

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.295622Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9c96e927-e349-4231-9039-6c9092f4b296 · outbound

This paper cites Equilibrium computation of generalized nash games: A new lagrangian-based approach.

Beyond the PPAD hardness of Auto-bidding Auctions Equilibrium computation of generalized nash games: A new lagrangian-based approach

Reference 86

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.300385Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1ca818d9-b5e3-4b94-b771-0919be7292b8 · outbound

This paper cites User satisfaction in competitive sponsored search.

Beyond the PPAD hardness of Auto-bidding Auctions User satisfaction in competitive sponsored search

Reference 87

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.304538Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ff7ba1f3-eb9f-4020-bf65-25a5c184d10f · outbound

This paper cites Beyond the nash equilibrium barrier.

Beyond the PPAD hardness of Auto-bidding Auctions Beyond the nash equilibrium barrier

Reference 88

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.308934Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 84a1fb6a-6d2d-4269-85b0-1ee48c5c6ab2 · outbound

This paper cites Linear convergence of gradient and proximal-gradient methods under the polyak- ojasiewicz condition.

Beyond the PPAD hardness of Auto-bidding Auctions Linear convergence of gradient and proximal-gradient methods under the polyak- ojasiewicz condition

Reference 89

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.313082Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dad59e6e-84fd-4777-b361-c655d4ee4486 · outbound

This paper cites Beyond competitive analysis.

Beyond the PPAD hardness of Auto-bidding Auctions Beyond competitive analysis

Reference 90

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.317362Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 26651a51-bdd2-470b-8f5b-2c1c11fbdead · outbound

This paper cites Computing the nucleolus of weighted cooperative matching games in polynomial time.

Beyond the PPAD hardness of Auto-bidding Auctions Computing the nucleolus of weighted cooperative matching games in polynomial time

Reference 91

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.321519Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4be8868c-c84f-4ea3-bb24-b35c57f3f985 · outbound

This paper cites No-regret online autobidding algorithms in first-price auctions.

Beyond the PPAD hardness of Auto-bidding Auctions No-regret online autobidding algorithms in first-price auctions

Reference 92

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.325505Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7bfc6ae2-6103-4fe9-b4a0-f148d9a73442 · outbound

This paper cites Relatively smooth convex optimization by first-order methods, and applications.

Beyond the PPAD hardness of Auto-bidding Auctions Relatively smooth convex optimization by first-order methods, and applications

Reference 93

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.329631Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 275b8621-9396-4a87-858f-fc9efdafd355 · outbound

This paper cites Partitioning friends fairly.

Beyond the PPAD hardness of Auto-bidding Auctions Partitioning friends fairly

Reference 94

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.334432Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation acf11fdf-0ca8-49e4-855f-ca28deffa5f6 · outbound

This paper cites Adaptive accelerated (extra-)gradient methods with variance reduction.

Beyond the PPAD hardness of Auto-bidding Auctions Adaptive accelerated (extra-)gradient methods with variance reduction

Reference 95

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.338515Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 43618fdf-1cbb-45b6-a53a-be6644e17680 · outbound

This paper cites Une propri \'e t \'e topologique des sous-ensembles analytiques r \'e els.

Beyond the PPAD hardness of Auto-bidding Auctions Une propri \'e t \'e topologique des sous-ensembles analytiques r \'e els

Reference 96

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.342498Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 62a95ed2-80a2-432a-af1f-96328ff4eb03 · outbound

This paper cites On the competition complexity of dynamic mechanism design.

Beyond the PPAD hardness of Auto-bidding Auctions On the competition complexity of dynamic mechanism design

Reference 97

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.346624Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 77aaa233-8926-4a2f-91ed-ffc65a009de9 · outbound

This paper cites Autobidders with budget and roi constraints: Efficiency, regret, and pacing dynamics.

Beyond the PPAD hardness of Auto-bidding Auctions Autobidders with budget and roi constraints: Efficiency, regret, and pacing dynamics

Reference 98

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.350939Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e944c896-d798-4e26-9153-0580209616d4 · outbound

This paper cites Approximately Optimal Mechanism Design for Competing Sellers.

Beyond the PPAD hardness of Auto-bidding Auctions Approximately Optimal Mechanism Design for Competing Sellers

Reference 99

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.355010Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c0ef3df7-dd45-466a-b680-9c92a4b41396 · outbound

This paper cites Proximit\'e et dualit\'e dans un espace hilbertien.

Beyond the PPAD hardness of Auto-bidding Auctions Proximit\'e et dualit\'e dans un espace hilbertien

Reference 100

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.359183Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 965c65ce-819c-49f5-8c88-a2b62cdac286 · outbound

This paper cites Note on non-cooperative convex games.

Beyond the PPAD hardness of Auto-bidding Auctions Note on non-cooperative convex games

Reference 101

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.363148Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1bf6a8dc-553d-410f-9a9d-595dc6019d7e · outbound

This paper cites Solving a class of non-convex min-max games using iterative first order methods.

Beyond the PPAD hardness of Auto-bidding Auctions Solving a class of non-convex min-max games using iterative first order methods

Reference 102

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.367628Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c1679e7b-ff82-431a-aa1c-d18445617586 · outbound

This paper cites Proximal algorithms.

Beyond the PPAD hardness of Auto-bidding Auctions Proximal algorithms

Reference 103

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.371807Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 345cdeb7-3ba8-4658-8704-45ed42444823 · outbound

This paper cites Quasi-variational inequalities, generalized nash equilibria, and multi-leader-follower games.

Beyond the PPAD hardness of Auto-bidding Auctions Quasi-variational inequalities, generalized nash equilibria, and multi-leader-follower games

Reference 104

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.375871Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a2e272dc-9eb7-4258-8e7f-3654796789e1 · outbound

This paper cites Paes Leme, G.

Beyond the PPAD hardness of Auto-bidding Auctions Paes Leme, G

Reference 105

Resolution: unresolved; no resolver link, observed 2026-08-04T18:54:44.380142Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers