Search alternatives:
"the post price" » "the most price" (Expand Search)
Showing 1 - 7 results of 7 for search '(("the lost price") OR ("the post price"))', query time: 0.20s Refine Results
  1. 1
  2. 2

    Horse trading in the age of cars : men in the marketplace / Steven M. Gelber. by Gelber, Steven M.

    Published 2008
    Table of Contents:
    Full text (Wentworth users only)
    Electronic eBook
  3. 3

    Fundamentals of Computation Theory 23rd International Symposium, FCT 2021, Athens, Greece, September 12–15, 2021, Proceedings / edited by Evripidis Bampis, Aris Pagourtzis.

    Published 2021
    Table of Contents: “…Invited papers -- Two sided matching markets with strongly correlated random preferences -- Communicating Finite state machines and an extensible toolchain for multiparty session types -- Contributed papers -- First-Order logic and its Infinitary Quantifier Extensions over Countable Words -- From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization -- A Poly-Log Competitive Posted-Price Algorithm for Online Metrical Matching on a Spider -- Computational Complexity of Covering Disconnected Multigraphs -- The Complexity of Bicriteria Tree-depth -- TS-Reconfiguration of Dominating Sets in circle and circular-arc graphs -- Bipartite 3-Regular Counting Problems with Mixed Signs -- The Satisfiability Problem for a Quantitative Fragment of PCTL -- Beyond the BEST Theorem: Fast Assessment of Eulerian Trails -- Regular Model Checking with Regular Relations -- Minimum Consistent Subset of Trees -- Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes -- The Space Complexity of Sum Labelling -- On Minimizing Regular Expressions Without Kleene Star -- Computational Complexity of Computing a Quasi-Proper Equilibrium -- Computational Complexity of Synchronization under Sparse Regular Constraints -- On Dasgupta’s hierarchical clustering objective and its relation to other graph parameter -- Mengerian Temporal Graphs Revisited -- Faster FPT Algorithms for Deletion to Pairs of Graph Classes -- Fast Algorithms for the Rooted Triplet Distance Between Caterpillars -- Deciding Top-Down Determinism of Regular Tree Languages -- Propositional Gossip Protocols -- Complexity of word problems for HNN-extensions -- On Finding Separators in Temporal Split and Permutation Graphs -- The Possible Winner Problem with Uncertain Weights Revisited -- Streaming Deletion Problems Parameterized by Vertex Cover -- On the Hardness of the Determinant: Sum of Regular Set-Multilinear Circuits -- Concentration of Collision Estimator -- Valency-based Consensus under Message Adversaries without Limit-Closure. .…”
    Full text (Wentworth users only)
    Electronic eBook
  4. 4

    Web and Internet Economics 17th International Conference, WINE 2021, Potsdam, Germany, December 14–17, 2021, Proceedings / edited by Michal Feldman, Hu Fu, Inbal Talgam-Cohen.

    Published 2022
    Table of Contents: “…Mechanism Design and Pricing -- Two-way Greedy: Algorithms for Imperfect Rationality -- Bayesian Persuasion in Sequential Trials -- The Optimality of Upgrade Pricing -- On Symmetries in Multi-Dimensional Mechanism Design -- Welfare-Preserving $nvarepsilon$-BIC to BIC Transformation with Negligible Revenue Loss -- Strategyproof Facility Location in Perturbation Stable Instances -- Contract Design for A orestation Programs -- Relaxing the independence assumption in sequential posted pricing, prophet inequality, and random bipartite matching -- Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness -- On the benefits of being constrained when receiving signals -- Towards a Characterization of Worst Case Equilibria in the Discriminatory Price Auction -- Matching, Markets and Equilibria -- Improved Analysis of RANKING for Online Vertex-Weighted Bipartite Matching in the Random Order Model -- Beyond Pigouvian Taxes: A Worst Case Analysis -- The core of housing markets from an agent's perspective: Is it worth sprucing up your home -- Mechanisms for Trading Durable Goods -- Formal Barriers to Simple Algorithms for the Matroid Secretary Problem -- Threshold Tests as Quality Signals: Optimal Strategies, Equilibria, and Price of Anarchy -- The Platform Design Problem -- A Consumer-Theoretic Characterization of Fisher Market Equilibria -- Learning, Fairness, Privacy and Behavioral Models A tight negative example for MMS fair allocations -- Approximating Nash Social Welfare Under Binary XOS and Binary Subadditive Valuations -- Default Ambiguity: Finding the Best Solution to the Clearing Problem -- Planning on an Empty Stomach: On Agents with Projection Bias -- Eliciting Social Knowledge for Creditworthiness Assessment -- Social Choice and Cryptocurrencies -- Decentralized Asset Custody Scheme with Security against Rational Adversary -- The Distortion of Distributed Metric Social Choice -- Maximal Information Propagation via Lotteries -- Envy-free division of multi-layered cakes -- Computing envy-freeable allocations with limited subsidies.…”
    Full text (Wentworth users only)
    Electronic eBook
  5. 5

    An introduction to bunkering / by Nigel Draffin. by Draffin, Nigel

    Published 2008
    Table of Contents: “…-- Port authorities -- Customs -- Delivery companies -- Agents -- Shipping jargon -- Ship types -- Chapter 4 -- Prices -- Bunker price reports -- Hedging -- Posted prices…”
    Full text (Wentworth users only)
    Electronic eBook
  6. 6

    Combinatorial Optimization and Applications 16th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I / edited by Weili Wu, Jianxiong Gu...

    Published 2024
    Table of Contents: “…Optimization in Graphs -- An Efficient Local Search Algorithm for Correlation Clustering on Large Graphs -- Algorithms on a path covering problem with applications in transportation -- Faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated Edges -- An O(log n)-Competitive Posted-Price Algorithm for Online Matching on the Line -- Online Dominating Set and Coloring -- Near-Bipartiteness, Connected Near-Bipartiteness, Independent Feedback Vertex Set and Acyclic Vertex Cover on graphs having small dominating sets -- Exactly k MSTs: How many vertices suffice? …”
    Full text (Wentworth users only)
    Electronic eBook
  7. 7