How does Facebook Ads bidding strategy decide ties?

If 2 entities are targetting the same set of audience and set exactly the same bid strategy and bid amount then how does Facebook decide who wins the bid? What’s the tie-breaker logic?


Entity A set bid strategy as "Lowest Cost" and targets an audience who has an interest in "Computers".

Entity B set bid strategy as "Lowest Cost" and targets an audience who has an interest in "Computers".

Who wins the bid here? Entity A or Entity B?

Eldritch Smite: Can you decide whether the enemy goes prone or do they always go prone?

Once per turn when you hit a creature with your pact weapon, you can expend a warlock spell slot to deal an extra 1d8 force damage to the target, plus another 1d8 per level of the spell slot, and you can knock the target prone if it is Huge or smaller.

Since it says "can knock the target prone." I assumed it was optional, (though you wouldn’t have much reason not to if in melee, within 5 ft.)

How to decide to use, then how to use an http url in an email, explained to a five year old?

I’m terrified of clicking on links in emails, and yet a colleague insists I do.

When I receive an email in my gmail account that contains links of the form along with its password, apparently sent from someone I know and expect it from, and who has supplied the password for the link to their NAS right next to it, should I try to overcome my fear of clicking on links in emails and consider clicking on it as at least fairly safe? Should I instead copy it paste it in a new tab?

The idea is that the document is evolving so the link will provide the latest version, but should I insist the colleague email me the document directly?

tl;dr: Should I

  1. click url
  2. copy/paste url in new tab
  3. balk, request document be emailed each time

If possible, can an answer be written in simple language?

Cropped, blanked out screenshot from email I received in my gmail:

partial screenshot of emailed urls

I cant not decide what to do with an old domain, I need opinions

I have a website that I used for blog few years back. I wrote a lot of articles and uploaded old games. I had little knowledge about monetization and rules and stuff. I wrote technology articles, windows tips, Linux tips, software related tips and enjoyed a lot. I used adsense at the website and earned as well. Site reached at 20,000 views per day and attracted a lot of traffic. Then after couple of years, adsense was banned for that domain. I loved the site and I kept it that way.

  • Now it has no income streams, no ads – only adsense was good enough as revenue stream
  • All articles are old now
  • WordPress software is old at that domain and now i can not even open admin area because i did not upgrade WordPress for a long time
  • It has little value if i try to sell domain I do not want to leave the domain. I want to use it. Its been years I have kept this domain. But it has no income stream. I don’t have anything to sell at it. But I still want to use it and I want to remove all old posts and start a fresh WordPress at it.

Only potential that I see is, people reach out to me and ask to post sponsored posts due to DA value. What should I do? Please advise. I don’t think I can be successful at affiliate / amazon affiliates / I tried but that did not work for me.

Any idea that how can I use this domain for anything interesting or make it valuable again?

Can we decide if a number is a power of any given $K$ in polynomial-time?

It is simple to decide powers of 2 in $ O(n)$ time because it’s just "0-bit Unary" after bit-1. (eg. $ 1000$ is a power of 2 in binary).

I haven’t found many other trivial powers of $ K$ that can be decided in polynomial-time with the binary-length of the input.


Can we decide if a number is a power of any given $ K$ in polynomial-time and in a practical amount of time?

Something not naive such as keep dividing $ N$ by $ K$ until you reach the smallest value $ 2$ for deciding a power of 2.

How to decide sprite size for isometric tile textures?

enter image description here

I want to draw isometric tiles with arbitrary tile sizes. For example above picture there are 1×1 and 3×2 sized tiles.

The textures have arbitrary height because of decoration. a is the tile’s height b is texture’s height c is tile’s width. I can’t figure out what the sprite size should be when I lay these out on screen.

Maybe I should have exact tile sizes cover the whole texture without decorations (a == b). But still what the sprite size should be?

Decide if a string is a member of a language that represents $P$?

For some enumeration of the complexity class P (such as this as an example: How does an enumerator for machines for languages work?), for each string 𝑝 in the enumeration, does there exist some other string (certificate) 𝑐 that allows you to verify 𝑝 is a member of the enumeration in poly time? I believe that it might be possible in poly time because all we have to do is check if a string fits some certain format (format of the encoding)?

A decision problem $ P$ is poly time verifiable iff there is an algorithm 𝑉 called verifier such that if $ P(w)=$ π‘ŒπΈπ‘† then there is a string $ c$ s.t. $ 𝑉(w,c)=$ π‘ŒπΈπ‘†, if $ P(w)=𝑁𝑂$ then for all strings $ c$ , $ 𝑉(w,c)=$ 𝑁𝑂 and V runs in $ O(w^{k})$ for some constant $ k$ for all inputs $ w$ .

Given an algorithm, decide whether it runs in polynomial time?

This problem is not decidable (reducible to halting problem) but is semi-decidable and therefor verifiable (as those two definitions are equivalent: How to prove semi-decidable = verifiable?).

However, is this problem poly-time verifiable? A decision problem 𝑄 is in poly time verifiable iff

there is an algorithm 𝑉 called verifier such that V runs in $ O(x^{c})$ for some constant c for all inputs π‘₯,

if 𝑄(π‘₯)=π‘ŒπΈπ‘† then there is a string 𝑦 such that 𝑉(π‘₯,𝑦)=π‘ŒπΈπ‘†, if 𝑄(π‘₯)=𝑁𝑂 then for all strings 𝑦, 𝑉(π‘₯,𝑦)=𝑁𝑂.

Example: for an enumeration of P (such as this): How does an enumerator for machines for languages work? for each string $ p$ in the enumeration, does there exist some other string (certificate) $ c$ that allows you to verify $ p$ is a member of the enumeration in poly time?